<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<title>STRATEGIC CONSTRUCTION:  Fichier source de /Users/pierre-loupbarazzutti/Desktop/svn/silverstarlif7/projet/src/Jeu.c</title>

<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
</script>


</head>
<body>
<div id="top"><!-- do not remove this div! -->


<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  
  
  <td style="padding-left: 0.5em;">
   <div id="projectname">STRATEGIC CONSTRUCTION
   
   </div>
   
  </td>
  
  
  
 </tr>
 </tbody>
</table>
</div>

<!-- Généré par Doxygen 1.8.0 -->
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Page&#160;principale</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Fichiers</span></a></li>
      <li><a href="dirs.html"><span>Répertoires</span></a></li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>Liste&#160;des&#160;fichiers</span></a></li>
      <li><a href="globals.html"><span>Membres&#160;de&#160;fichier</span></a></li>
    </ul>
  </div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
  initNavTree('_jeu_8c.html','');
</script>
<div id="doc-content">
<div class="header">
  <div class="headertitle">
<div class="title">Jeu.c</div>  </div>
</div><!--header-->
<div class="contents">
<a href="_jeu_8c.html">Aller à la documentation de ce fichier.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="preprocessor">#include &quot;<a class="code" href="_jeu_8h.html">Jeu.h</a>&quot;</span>
<a name="l00002"></a>00002 <span class="preprocessor">#include &lt;assert.h&gt;</span>
<a name="l00003"></a>00003 <span class="preprocessor">#include &lt;stdio.h&gt;</span>
<a name="l00004"></a>00004 <span class="preprocessor">#include &lt;stdlib.h&gt;</span>
<a name="l00005"></a>00005 
<a name="l00006"></a><a class="code" href="_jeu_8h.html#a923f2d51dff59e01df1d14c2079fd2dc">00006</a> <span class="keywordtype">void</span> <a class="code" href="_jeu_8c.html#af7e9e407e19c86216da89b192f3a4712">InitialisationJeu</a> (<a class="code" href="structs_jeu.html">Jeu</a> * j)
<a name="l00007"></a>00007 {
<a name="l00008"></a>00008         (*j).lien_sur_terrain = (<a class="code" href="structs_terrain.html">Terrain</a>*) malloc (<span class="keyword">sizeof</span> (<a class="code" href="structs_terrain.html">Terrain</a>));
<a name="l00009"></a>00009         <a class="code" href="_terrain_8c.html#a7368383a5bf78f14daa56ad29f17ec1b">InitialisationTerrain</a> ((*j).lien_sur_terrain, 16,10);
<a name="l00010"></a>00010         (*j).tableau_de_joueurs = (<a class="code" href="structs_joueur.html">Joueur</a>*) malloc (2*<span class="keyword">sizeof</span>(<a class="code" href="structs_joueur.html">Joueur</a>));
<a name="l00011"></a>00011         <a class="code" href="_joueur_8c.html#afb1b8edcb5eab1a97f209c53c2cc462b">InitialisationJoueur</a>(&amp;(*j).tableau_de_joueurs[0]);
<a name="l00012"></a>00012         <a class="code" href="_joueur_8c.html#afb1b8edcb5eab1a97f209c53c2cc462b">InitialisationJoueur</a>(&amp;(*j).tableau_de_joueurs[1]);
<a name="l00013"></a>00013         (*j).tour = 0;
<a name="l00014"></a>00014         
<a name="l00015"></a>00015 }
<a name="l00016"></a>00016 
<a name="l00017"></a><a class="code" href="_jeu_8h.html#a930e83c086fd3b04afb97fda5f3350ec">00017</a> <a class="code" href="structs_terrain.html">Terrain</a> * <a class="code" href="_jeu_8c.html#a930e83c086fd3b04afb97fda5f3350ec">ObtientTerrainJeu</a>(<a class="code" href="structs_jeu.html">Jeu</a> * j)
<a name="l00018"></a>00018 {
<a name="l00019"></a>00019   <span class="keywordflow">return</span> ((*j).lien_sur_terrain);
<a name="l00020"></a>00020 }
<a name="l00021"></a>00021 
<a name="l00022"></a>00022 
<a name="l00023"></a><a class="code" href="_jeu_8h.html#a870adf9b0857e5fd443c1de05a04952b">00023</a> <span class="keyword">const</span> <a class="code" href="structs_terrain.html">Terrain</a> * <a class="code" href="_jeu_8c.html#a870adf9b0857e5fd443c1de05a04952b">ObtientTerrainConstJeu</a>(<a class="code" href="structs_jeu.html">Jeu</a> * j)
<a name="l00024"></a>00024 {
<a name="l00025"></a>00025   <span class="keywordflow">return</span> ((*j).lien_sur_terrain);
<a name="l00026"></a>00026 }
<a name="l00027"></a>00027 
<a name="l00028"></a>00028 
<a name="l00029"></a><a class="code" href="_jeu_8h.html#aecd7eb50119dfdbaa3eeb4be5b10de05">00029</a> <span class="keywordtype">void</span> <a class="code" href="_jeu_8c.html#aecd7eb50119dfdbaa3eeb4be5b10de05">RecherchePossibiliteDeplacement</a> (<a class="code" href="structs_jeu.html">Jeu</a> * j, <span class="keywordtype">int</span> * possibilite,<span class="keywordtype">int</span> x, <span class="keywordtype">int</span> y)
<a name="l00030"></a>00030 {
<a name="l00031"></a>00031         <span class="keywordtype">int</span> i;
<a name="l00032"></a>00032         <span class="keywordtype">int</span> k;
<a name="l00033"></a>00033         <a class="code" href="structs_terrain.html">Terrain</a> * t = <a class="code" href="_jeu_8c.html#a930e83c086fd3b04afb97fda5f3350ec">ObtientTerrainJeu</a> (j);
<a name="l00034"></a>00034         <span class="keywordtype">int</span> modification = 1;
<a name="l00035"></a>00035         <span class="keywordtype">int</span> maximum;
<a name="l00036"></a>00036         assert(0&lt;=x &amp;&amp; x&lt;=(*t).dimx);
<a name="l00037"></a>00037         assert(0&lt;=y &amp;&amp; y&lt;=(*t).dimy);
<a name="l00038"></a>00038         <span class="keywordflow">for</span> (i=0; i&lt;(*t).dimy; i++)
<a name="l00039"></a>00039         {
<a name="l00040"></a>00040                 <span class="keywordflow">for</span> (k=0; k&lt;(*t).dimx; k++)
<a name="l00041"></a>00041                 {
<a name="l00042"></a>00042                         <span class="keywordflow">if</span> (k == x &amp;&amp; i == y)
<a name="l00043"></a>00043                         {
<a name="l00044"></a>00044                                 possibilite[i*(*t).dimx+k] = (*(*t).cases[y*(*t).dimx+x].lunite).deplacement + 2;
<a name="l00045"></a>00045                                 
<a name="l00046"></a>00046                         }
<a name="l00047"></a>00047                         <span class="keywordflow">else</span>
<a name="l00048"></a>00048                         {
<a name="l00049"></a>00049                                 possibilite[i*(*t).dimx+k] = 0;
<a name="l00050"></a>00050                         }
<a name="l00051"></a>00051                 }
<a name="l00052"></a>00052         }
<a name="l00053"></a>00053         <span class="keywordflow">while</span> (modification != 0)
<a name="l00054"></a>00054         {
<a name="l00055"></a>00055                 modification = 0;
<a name="l00056"></a>00056                 <span class="keywordflow">for</span> (i=0; i&lt; (*t).dimy; i++)
<a name="l00057"></a>00057                 {
<a name="l00058"></a>00058                         <span class="keywordflow">for</span> (k=0;k&lt;(*t).dimx;k++)
<a name="l00059"></a>00059                         {
<a name="l00060"></a>00060                                 maximum = 0;
<a name="l00061"></a>00061                                 <span class="keywordflow">if</span> (k &gt; 0)
<a name="l00062"></a>00062                                 {
<a name="l00063"></a>00063                                         <span class="keywordflow">if</span> (possibilite[i*(*t).dimx+k-1]&gt; 0)
<a name="l00064"></a>00064                                         {
<a name="l00065"></a>00065                                                 maximum = possibilite[i*(*t).dimx+k-1];
<a name="l00066"></a>00066                                         }
<a name="l00067"></a>00067                                 }
<a name="l00068"></a>00068                                 <span class="keywordflow">if</span> (i &gt; 0)
<a name="l00069"></a>00069                                 {
<a name="l00070"></a>00070                                         <span class="keywordflow">if</span> (possibilite[(i-1)*(*t).dimx+k] &gt; 0)
<a name="l00071"></a>00071                                         {
<a name="l00072"></a>00072                                                 <span class="keywordflow">if</span> (maximum == 0)
<a name="l00073"></a>00073                                                 {
<a name="l00074"></a>00074                                                         maximum = possibilite[(i-1)*(*t).dimx+k];
<a name="l00075"></a>00075                                                 }
<a name="l00076"></a>00076                                                 <span class="keywordflow">else</span>
<a name="l00077"></a>00077                                                 {
<a name="l00078"></a>00078                                                         <span class="keywordflow">if</span> (maximum &lt; possibilite[(i-1)*(*t).dimx+k])
<a name="l00079"></a>00079                                                         {
<a name="l00080"></a>00080                                                                 maximum = possibilite[(i-1)*(*t).dimx+k];
<a name="l00081"></a>00081                                                         }
<a name="l00082"></a>00082                                                 }
<a name="l00083"></a>00083                                         }
<a name="l00084"></a>00084                                 }
<a name="l00085"></a>00085                                 <span class="keywordflow">if</span> (i &lt; (*t).dimy-1)
<a name="l00086"></a>00086                                 {
<a name="l00087"></a>00087                                         <span class="keywordflow">if</span> (possibilite[(i+1)*(*t).dimx+k] &gt; 0)
<a name="l00088"></a>00088                                         {
<a name="l00089"></a>00089                                                 <span class="keywordflow">if</span> (maximum == 0)
<a name="l00090"></a>00090                                                 {
<a name="l00091"></a>00091                                                         maximum = possibilite[(i+1)*(*t).dimx+k];
<a name="l00092"></a>00092                                                 }
<a name="l00093"></a>00093                                                 <span class="keywordflow">else</span>
<a name="l00094"></a>00094                                                 {
<a name="l00095"></a>00095                                                         <span class="keywordflow">if</span> (maximum &lt; possibilite[(i+1)*(*t).dimx+k])
<a name="l00096"></a>00096                                                         {
<a name="l00097"></a>00097                                                                 maximum = possibilite[(i+1)*(*t).dimx+k];
<a name="l00098"></a>00098                                                         }
<a name="l00099"></a>00099                                                 }
<a name="l00100"></a>00100                                         }
<a name="l00101"></a>00101                                 }
<a name="l00102"></a>00102                                 <span class="keywordflow">if</span> (k &lt; (*t).dimx-1)
<a name="l00103"></a>00103                                 {
<a name="l00104"></a>00104                                         <span class="keywordflow">if</span> (possibilite[i*(*t).dimx+k+1] &gt; 0)
<a name="l00105"></a>00105                                         {
<a name="l00106"></a>00106                                                 <span class="keywordflow">if</span> (maximum == 0)
<a name="l00107"></a>00107                                                 {
<a name="l00108"></a>00108                                                         maximum = possibilite[i*(*t).dimx+k+1];
<a name="l00109"></a>00109                                                 }
<a name="l00110"></a>00110                                                 <span class="keywordflow">else</span>
<a name="l00111"></a>00111                                                 {
<a name="l00112"></a>00112                                                         <span class="keywordflow">if</span> (maximum &lt; possibilite[i*(*t).dimx+k+1])
<a name="l00113"></a>00113                                                         {
<a name="l00114"></a>00114                                                                 maximum = possibilite[i*(*t).dimx+k+1];
<a name="l00115"></a>00115                                                         }
<a name="l00116"></a>00116                                                 }
<a name="l00117"></a>00117                                         }
<a name="l00118"></a>00118                                 }
<a name="l00119"></a>00119                                 <span class="keywordflow">if</span> (maximum -1 &gt; 0 &amp;&amp; possibilite[i*(*t).dimx+k] == 0)
<a name="l00120"></a>00120                                 {
<a name="l00121"></a>00121                                         <span class="keywordflow">if</span> ((*t).cases[i*(*t).dimx+k].type_decor == 0 || (*t).cases[i*(*t).dimx+k].type_decor == 4)
<a name="l00122"></a>00122                                         {
<a name="l00123"></a>00123                                                 <span class="keywordflow">if</span> ((*t).cases[i*(*t).dimx+k].lunite != NULL)
<a name="l00124"></a>00124                                                 {
<a name="l00125"></a>00125                                                         <span class="keywordflow">if</span> ((*(*t).cases[i*(*t).dimx+k].lunite).equipe != (*(*t).cases[y*(*t).dimx+x].lunite).equipe)
<a name="l00126"></a>00126                                                         {
<a name="l00127"></a>00127                                                                 possibilite[i*(*t).dimx+k] = 1;
<a name="l00128"></a>00128                                                         }
<a name="l00129"></a>00129                                                         <span class="keywordflow">else</span>
<a name="l00130"></a>00130                                                         {
<a name="l00131"></a>00131                                                                 possibilite[i*(*t).dimx+k] = 0;
<a name="l00132"></a>00132                                                         }
<a name="l00133"></a>00133                                                 }
<a name="l00134"></a>00134                                                 <span class="keywordflow">else</span>
<a name="l00135"></a>00135                                                 {
<a name="l00136"></a>00136                                                         possibilite[i*(*t).dimx+k] = maximum - 1;
<a name="l00137"></a>00137                                                         modification++;
<a name="l00138"></a>00138                                                 }
<a name="l00139"></a>00139                                         }
<a name="l00140"></a>00140                                         <span class="keywordflow">else</span>
<a name="l00141"></a>00141                                         {
<a name="l00142"></a>00142                                                 possibilite[i*(*t).dimx+k] = 1;
<a name="l00143"></a>00143                                         }
<a name="l00144"></a>00144 
<a name="l00145"></a>00145                                 }
<a name="l00146"></a>00146                         }
<a name="l00147"></a>00147                 }               
<a name="l00148"></a>00148         }
<a name="l00149"></a>00149 }
<a name="l00150"></a>00150 
<a name="l00151"></a>00151 
<a name="l00152"></a><a class="code" href="_jeu_8h.html#a4968ea65eef1ab62bb43f88371760321">00152</a> <span class="keywordtype">void</span> <a class="code" href="_jeu_8c.html#a4968ea65eef1ab62bb43f88371760321">ChangementTour</a>(<a class="code" href="structs_jeu.html">Jeu</a> * j)
<a name="l00153"></a>00153 {
<a name="l00154"></a>00154   <a class="code" href="structs_terrain.html">Terrain</a> * t = <a class="code" href="_jeu_8c.html#a930e83c086fd3b04afb97fda5f3350ec">ObtientTerrainJeu</a>(j);
<a name="l00155"></a>00155   <span class="keywordtype">int</span> i = 0;
<a name="l00156"></a>00156   <span class="keywordtype">int</span> k = 0;
<a name="l00157"></a>00157   (*j).tour = (*j).tour + 1;
<a name="l00158"></a>00158   
<a name="l00159"></a>00159   <span class="keywordflow">for</span>(i=0;i&lt;(*t).dimy;i++)
<a name="l00160"></a>00160   {
<a name="l00161"></a>00161      <span class="keywordflow">for</span>(k=0;k&lt;(*t).dimx;k++)
<a name="l00162"></a>00162      {
<a name="l00163"></a>00163        <span class="keywordflow">if</span>((*t).cases[i*(*t).dimx+k].lunite != NULL)
<a name="l00164"></a>00164        {
<a name="l00165"></a>00165          (*(*t).cases[i*(*t).dimx+k].lunite).utilise = 0;
<a name="l00166"></a>00166        }
<a name="l00167"></a>00167        <span class="keywordflow">if</span> ((*t).cases[i*(*t).dimx+k].type_decor == 3 &amp;&amp; (*j).tour%2 == (*t).cases[i*(*t).dimx+k].groupe_decor)
<a name="l00168"></a>00168                         {
<a name="l00169"></a>00169                                 (*t).cases[i*(*t).dimx+k].type_decor = 4;
<a name="l00170"></a>00170                         }
<a name="l00171"></a>00171      }
<a name="l00172"></a>00172   }
<a name="l00173"></a>00173 
<a name="l00174"></a>00174 }
<a name="l00175"></a>00175 
<a name="l00176"></a>00176 
<a name="l00177"></a><a class="code" href="_jeu_8h.html#a1f4c63f7dec1f4a7ba08a1bebae64f05">00177</a> <span class="keywordtype">int</span> <a class="code" href="_jeu_8c.html#a1f4c63f7dec1f4a7ba08a1bebae64f05">VerificationFinJeu</a> (<a class="code" href="structs_jeu.html">Jeu</a> * j)
<a name="l00178"></a>00178 {
<a name="l00179"></a>00179         <span class="keywordflow">if</span> ((*j).tableau_de_joueurs[0].nombre_unites == 0 || (*j).tableau_de_joueurs[1].nombre_unites == 0)
<a name="l00180"></a>00180         {
<a name="l00181"></a>00181                 <span class="keywordflow">return</span> 0;
<a name="l00182"></a>00182         }
<a name="l00183"></a>00183         <span class="keywordflow">return</span> 1;
<a name="l00184"></a>00184 }
<a name="l00185"></a>00185 
<a name="l00186"></a>00186 
<a name="l00187"></a><a class="code" href="_jeu_8h.html#ad2e767bdc6fb46445dfc38906b5279f0">00187</a> <span class="keywordtype">void</span> <a class="code" href="_jeu_8c.html#ad2e767bdc6fb46445dfc38906b5279f0">ChargementJeu</a>(<a class="code" href="structs_jeu.html">Jeu</a> * j, <span class="keyword">const</span> <span class="keywordtype">char</span> * nomfic)
<a name="l00188"></a>00188 {
<a name="l00189"></a>00189         <span class="keywordtype">int</span> i;
<a name="l00190"></a>00190         <span class="keywordtype">int</span> k;
<a name="l00191"></a>00191         <span class="keywordtype">int</span> recup;
<a name="l00192"></a>00192         <span class="keywordtype">int</span> dimx;
<a name="l00193"></a>00193         <span class="keywordtype">int</span> dimy;
<a name="l00194"></a>00194         <span class="keywordtype">float</span> recup2;
<a name="l00195"></a>00195         FILE * fic = fopen(nomfic,<span class="stringliteral">&quot;r&quot;</span>);
<a name="l00196"></a>00196         <a class="code" href="structs_terrain.html">Terrain</a> * t = <a class="code" href="_jeu_8c.html#a930e83c086fd3b04afb97fda5f3350ec">ObtientTerrainJeu</a>(j);
<a name="l00197"></a>00197         <span class="keywordflow">if</span>(fic == NULL)
<a name="l00198"></a>00198         {
<a name="l00199"></a>00199                 printf(<span class="stringliteral">&quot;ERROR \n&quot;</span>);
<a name="l00200"></a>00200                 exit(EXIT_FAILURE);     
<a name="l00201"></a>00201         }
<a name="l00202"></a>00202         
<a name="l00203"></a>00203         
<a name="l00204"></a>00204         fscanf(fic ,<span class="stringliteral">&quot;%d\n\n&quot;</span>, &amp;recup);
<a name="l00205"></a>00205         (*j).tour = recup;
<a name="l00206"></a>00206         fscanf(fic ,<span class="stringliteral">&quot;%d &quot;</span>, &amp;recup);
<a name="l00207"></a>00207         dimy = recup;
<a name="l00208"></a>00208         fscanf(fic ,<span class="stringliteral">&quot;%d\n\n&quot;</span>, &amp;recup);
<a name="l00209"></a>00209         dimx = recup;
<a name="l00210"></a>00210         <a class="code" href="_terrain_8c.html#a552e8705aae2fb058d130b63a6c99d45">DestructionTerrain</a> (t);
<a name="l00211"></a>00211         <a class="code" href="_terrain_8c.html#a7368383a5bf78f14daa56ad29f17ec1b">InitialisationTerrain</a> (t,dimx,dimy);
<a name="l00212"></a>00212         fscanf(fic ,<span class="stringliteral">&quot;%d\n\n&quot;</span>, &amp;recup);
<a name="l00213"></a>00213         (*j).mapencours = recup;
<a name="l00214"></a>00214         fscanf(fic ,<span class="stringliteral">&quot;%d &quot;</span>, &amp;recup);
<a name="l00215"></a>00215         (*j).tableau_de_joueurs[0].bois = recup;
<a name="l00216"></a>00216         fscanf(fic ,<span class="stringliteral">&quot;%d &quot;</span>, &amp;recup);
<a name="l00217"></a>00217         (*j).tableau_de_joueurs[0].nourriture = recup;
<a name="l00218"></a>00218         fscanf(fic ,<span class="stringliteral">&quot;%d &quot;</span>, &amp;recup);
<a name="l00219"></a>00219         (*j).tableau_de_joueurs[0].nombre_unites = recup;
<a name="l00220"></a>00220         fscanf(fic ,<span class="stringliteral">&quot;%d &quot;</span>, &amp;recup);
<a name="l00221"></a>00221         (*j).tableau_de_joueurs[0].nombre_batiments = recup;
<a name="l00222"></a>00222         fscanf(fic ,<span class="stringliteral">&quot;%d\n\n&quot;</span>, &amp;recup);
<a name="l00223"></a>00223         (*j).tableau_de_joueurs[0].joueur_ou_IA = recup;
<a name="l00224"></a>00224         
<a name="l00225"></a>00225         fscanf(fic ,<span class="stringliteral">&quot;%d &quot;</span>, &amp;recup);
<a name="l00226"></a>00226         (*j).tableau_de_joueurs[1].bois = recup;
<a name="l00227"></a>00227         fscanf(fic ,<span class="stringliteral">&quot;%d &quot;</span>, &amp;recup);
<a name="l00228"></a>00228         (*j).tableau_de_joueurs[1].nourriture = recup;
<a name="l00229"></a>00229         fscanf(fic ,<span class="stringliteral">&quot;%d &quot;</span>, &amp;recup);
<a name="l00230"></a>00230         (*j).tableau_de_joueurs[1].nombre_unites = recup;
<a name="l00231"></a>00231         fscanf(fic ,<span class="stringliteral">&quot;%d &quot;</span>, &amp;recup);
<a name="l00232"></a>00232         (*j).tableau_de_joueurs[1].nombre_batiments = recup;
<a name="l00233"></a>00233         fscanf(fic ,<span class="stringliteral">&quot;%d\n\n&quot;</span>, &amp;recup);
<a name="l00234"></a>00234         (*j).tableau_de_joueurs[1].joueur_ou_IA = recup;
<a name="l00235"></a>00235         
<a name="l00236"></a>00236         <span class="keywordflow">for</span> (i=0; i&lt; (*t).dimy;i++)
<a name="l00237"></a>00237         {
<a name="l00238"></a>00238                 <span class="keywordflow">for</span> (k=0; k&lt; (*t).dimx; k++)
<a name="l00239"></a>00239                 {
<a name="l00240"></a>00240                         fscanf(fic ,<span class="stringliteral">&quot;%d&quot;</span>, &amp;recup);
<a name="l00241"></a>00241                         (*t).cases[i*(*t).dimx+k].type_decor = recup;
<a name="l00242"></a>00242                         fscanf(fic ,<span class="stringliteral">&quot;%d&quot;</span>, &amp;recup);
<a name="l00243"></a>00243                         (*t).cases[i*(*t).dimx+k].vie = recup;
<a name="l00244"></a>00244                         fscanf(fic ,<span class="stringliteral">&quot;%d&quot;</span>, &amp;recup);
<a name="l00245"></a>00245                         (*t).cases[i*(*t).dimx+k].groupe_decor = recup;
<a name="l00246"></a>00246                 }
<a name="l00247"></a>00247         }
<a name="l00248"></a>00248         
<a name="l00249"></a>00249         <span class="keywordflow">for</span> (i=0; i&lt; (*t).dimy;i++)
<a name="l00250"></a>00250         {
<a name="l00251"></a>00251                 <span class="keywordflow">for</span> (k=0; k&lt; (*t).dimx; k++)
<a name="l00252"></a>00252                 {
<a name="l00253"></a>00253                         fscanf(fic ,<span class="stringliteral">&quot;%d&quot;</span>, &amp;recup);
<a name="l00254"></a>00254                         <span class="keywordflow">if</span> (recup == 0)
<a name="l00255"></a>00255                         {
<a name="l00256"></a>00256                                 (*t).cases[i*(*t).dimx+k].lunite = NULL;
<a name="l00257"></a>00257                         }
<a name="l00258"></a>00258                         <span class="keywordflow">else</span>
<a name="l00259"></a>00259                         {
<a name="l00260"></a>00260                                 (*t).cases[i*(*t).dimx+k].lunite = (<a class="code" href="structs_unite.html">Unite</a>*) malloc (<span class="keyword">sizeof</span> (<a class="code" href="structs_unite.html">Unite</a>));
<a name="l00261"></a>00261                                 (*(*t).cases[i*(*t).dimx+k].lunite).<a class="code" href="structs_fleches_deplacement.html#a33f58a0f9f0fcded8bee7599d8bb1ead">type</a> = recup;
<a name="l00262"></a>00262                                 fscanf(fic ,<span class="stringliteral">&quot;%d&quot;</span>, &amp;recup);
<a name="l00263"></a>00263                                 (*(*t).cases[i*(*t).dimx+k].lunite).vie = recup;
<a name="l00264"></a>00264                                 fscanf(fic ,<span class="stringliteral">&quot;%f&quot;</span>, &amp;recup2);
<a name="l00265"></a>00265                                 (*(*t).cases[i*(*t).dimx+k].lunite).attaque = recup2;
<a name="l00266"></a>00266                                 fscanf(fic ,<span class="stringliteral">&quot;%d&quot;</span>, &amp;recup);
<a name="l00267"></a>00267                                 (*(*t).cases[i*(*t).dimx+k].lunite).defense = recup;
<a name="l00268"></a>00268                                 fscanf(fic ,<span class="stringliteral">&quot;%d&quot;</span>, &amp;recup);
<a name="l00269"></a>00269                                 (*(*t).cases[i*(*t).dimx+k].lunite).deplacement = recup;
<a name="l00270"></a>00270                                 fscanf(fic ,<span class="stringliteral">&quot;%d&quot;</span>, &amp;recup);
<a name="l00271"></a>00271                                 (*(*t).cases[i*(*t).dimx+k].lunite).equipe = recup;
<a name="l00272"></a>00272                                 fscanf(fic ,<span class="stringliteral">&quot;%d&quot;</span>, &amp;recup);
<a name="l00273"></a>00273                                 (*(*t).cases[i*(*t).dimx+k].lunite).utilise = recup;
<a name="l00274"></a>00274                                 
<a name="l00275"></a>00275                         }
<a name="l00276"></a>00276                 }
<a name="l00277"></a>00277         }
<a name="l00278"></a>00278         fclose(fic);
<a name="l00279"></a>00279         
<a name="l00280"></a>00280 }
<a name="l00281"></a>00281 
<a name="l00282"></a>00282 
<a name="l00283"></a><a class="code" href="_jeu_8h.html#ae0c84a274809bb24d7445a97921c31d7">00283</a> <span class="keywordtype">void</span> <a class="code" href="_jeu_8c.html#ae0c84a274809bb24d7445a97921c31d7">DestructionJeu</a>(<a class="code" href="structs_jeu.html">Jeu</a> *j)
<a name="l00284"></a>00284 {
<a name="l00285"></a>00285    <a class="code" href="_terrain_8c.html#a552e8705aae2fb058d130b63a6c99d45">DestructionTerrain</a>((*j).lien_sur_terrain);
<a name="l00286"></a>00286    free((*j).lien_sur_terrain);
<a name="l00287"></a>00287    free((*j).tableau_de_joueurs);
<a name="l00288"></a>00288    (*j).tour = 0;
<a name="l00289"></a>00289 } 
<a name="l00290"></a>00290 
<a name="l00291"></a>00291 
<a name="l00292"></a><a class="code" href="_jeu_8h.html#af51cd7d3ccbfa3f1a0cd011ca5f35d5b">00292</a> <span class="keywordtype">void</span> <a class="code" href="_jeu_8c.html#af51cd7d3ccbfa3f1a0cd011ca5f35d5b">IntelligenceArtificielle</a> (<a class="code" href="structs_jeu.html">Jeu</a> * j)
<a name="l00293"></a>00293 {   
<a name="l00294"></a>00294     <a class="code" href="structs_terrain.html">Terrain</a> * t = <a class="code" href="_jeu_8c.html#a930e83c086fd3b04afb97fda5f3350ec">ObtientTerrainJeu</a>(j);
<a name="l00295"></a>00295         <span class="keywordtype">int</span> i = 0;
<a name="l00296"></a>00296         <span class="keywordtype">int</span> k = 0;
<a name="l00297"></a>00297         <span class="keywordtype">int</span> nbpecheur = 0;
<a name="l00298"></a>00298         <span class="keywordtype">int</span> nbbucheron = 0;
<a name="l00299"></a>00299         <span class="keywordtype">int</span> nbinfanterie = 0;
<a name="l00300"></a>00300         <span class="keywordtype">int</span> nbinfanterie2 = 0;
<a name="l00301"></a>00301         <span class="keywordtype">int</span> nbinfanterie3 = 0;
<a name="l00302"></a>00302         
<a name="l00303"></a>00303         <span class="keywordtype">int</span> nbinfanterieinv = 0;
<a name="l00304"></a>00304         <span class="keywordtype">int</span> nbinfanterieinv2 = 0;
<a name="l00305"></a>00305         <span class="keywordtype">int</span> nbinfanterieinv3 = 0;
<a name="l00306"></a>00306         
<a name="l00307"></a>00307         <span class="keywordtype">int</span> nbarbre = 0;
<a name="l00308"></a>00308         <span class="keywordflow">for</span>(i=0;i&lt;(*t).dimy;i++)
<a name="l00309"></a>00309         {
<a name="l00310"></a>00310                 <span class="keywordflow">for</span>(k=0;k&lt;(*t).dimx;k++) 
<a name="l00311"></a>00311             {
<a name="l00312"></a>00312                 <span class="keywordflow">if</span>((*t).cases[i*(*t).dimx+k].lunite != NULL)
<a name="l00313"></a>00313                 {
<a name="l00314"></a>00314                         <span class="keywordflow">if</span> ((*(*t).cases[i*(*t).dimx+k].lunite).equipe == (*j).tour%2 &amp;&amp; (*(*t).cases[i*(*t).dimx+k].lunite).utilise == 0)
<a name="l00315"></a>00315                         {
<a name="l00316"></a>00316                                 (*(*t).cases[i*(*t).dimx+k].lunite).utilise = 1;
<a name="l00317"></a>00317                                 <span class="keywordflow">switch</span>((*(*t).cases[i*(*t).dimx+k].lunite).type)
<a name="l00318"></a>00318                                 {
<a name="l00319"></a>00319                                   <span class="keywordflow">case</span> 1: 
<a name="l00320"></a>00320                                         <a class="code" href="_jeu_8c.html#a334b718b43351269700b84847fc72a0b">Radar</a>(j,k,i,1);
<a name="l00321"></a>00321                                         nbbucheron++;
<a name="l00322"></a>00322                                   <span class="keywordflow">break</span>;
<a name="l00323"></a>00323                                   <span class="keywordflow">case</span> 2: 
<a name="l00324"></a>00324                                         <a class="code" href="_jeu_8c.html#a334b718b43351269700b84847fc72a0b">Radar</a>(j,k,i,2);
<a name="l00325"></a>00325                                         nbpecheur++;
<a name="l00326"></a>00326                                   <span class="keywordflow">break</span>;
<a name="l00327"></a>00327                                   <span class="keywordflow">case</span> 3: 
<a name="l00328"></a>00328                                         <a class="code" href="_jeu_8c.html#a334b718b43351269700b84847fc72a0b">Radar</a>(j,k,i,3);
<a name="l00329"></a>00329                                         nbinfanterie++;
<a name="l00330"></a>00330                                   <span class="keywordflow">break</span>;
<a name="l00331"></a>00331                                    <span class="keywordflow">case</span> 4: 
<a name="l00332"></a>00332                                         <a class="code" href="_jeu_8c.html#a334b718b43351269700b84847fc72a0b">Radar</a>(j,k,i,3);
<a name="l00333"></a>00333                                         nbinfanterie2++;
<a name="l00334"></a>00334                                   <span class="keywordflow">break</span>;
<a name="l00335"></a>00335                                    <span class="keywordflow">case</span> 5: 
<a name="l00336"></a>00336                                         <a class="code" href="_jeu_8c.html#a334b718b43351269700b84847fc72a0b">Radar</a>(j,k,i,3);
<a name="l00337"></a>00337                                         nbinfanterie3++;
<a name="l00338"></a>00338                                   <span class="keywordflow">break</span>;
<a name="l00339"></a>00339                                 }
<a name="l00340"></a>00340                         }
<a name="l00341"></a>00341                         <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((*(*t).cases[i*(*t).dimx+k].lunite).equipe != (*j).tour%2)
<a name="l00342"></a>00342                         {       
<a name="l00343"></a>00343                                 <span class="keywordflow">switch</span>((*(*t).cases[i*(*t).dimx+k].lunite).type)
<a name="l00344"></a>00344                                 {
<a name="l00345"></a>00345                                   <span class="keywordflow">case</span> 3: 
<a name="l00346"></a>00346                                         nbinfanterieinv++;
<a name="l00347"></a>00347                                   <span class="keywordflow">break</span>;
<a name="l00348"></a>00348                                   <span class="keywordflow">case</span> 4: 
<a name="l00349"></a>00349                                         nbinfanterieinv2++;
<a name="l00350"></a>00350                                   <span class="keywordflow">break</span>;
<a name="l00351"></a>00351                                   <span class="keywordflow">case</span> 5: 
<a name="l00352"></a>00352                                         nbinfanterieinv3++;
<a name="l00353"></a>00353                                   <span class="keywordflow">break</span>;
<a name="l00354"></a>00354                                 }
<a name="l00355"></a>00355                         }
<a name="l00356"></a>00356                         }
<a name="l00357"></a>00357                         <span class="keywordflow">if</span> ((*t).cases[i*(*t).dimx+k].type_decor == 1)
<a name="l00358"></a>00358                 {
<a name="l00359"></a>00359                         nbarbre++;
<a name="l00360"></a>00360                 }
<a name="l00361"></a>00361             }
<a name="l00362"></a>00362         }
<a name="l00363"></a>00363         <span class="keywordflow">if</span> ((*j).tableau_de_joueurs[(*j).tour%2].nombre_batiments == 0)
<a name="l00364"></a>00364         {
<a name="l00365"></a>00365                 <span class="keywordflow">if</span> ((*j).tableau_de_joueurs[(*j).tour%2].bois &gt;= 100)
<a name="l00366"></a>00366                 {
<a name="l00367"></a>00367                         <span class="keywordflow">for</span>(i=0;i&lt;(*t).dimy;i++)
<a name="l00368"></a>00368                         {
<a name="l00369"></a>00369                                 <span class="keywordflow">for</span>(k=0;k&lt;(*t).dimx;k++) 
<a name="l00370"></a>00370                                 {
<a name="l00371"></a>00371                                         <a class="code" href="_jeu_8c.html#a719a70f9e4442b05627dda58da4e93db">AjouterMaisonJeu</a> (j, 1, k,i);
<a name="l00372"></a>00372                                 }
<a name="l00373"></a>00373                         }
<a name="l00374"></a>00374                 }
<a name="l00375"></a>00375         }
<a name="l00376"></a>00376         <span class="keywordflow">else</span>
<a name="l00377"></a>00377         {
<a name="l00378"></a>00378                 <span class="keywordflow">if</span> ((*j).tableau_de_joueurs[(*j).tour%2].bois &gt;= 100 &amp;&amp; (*j).tableau_de_joueurs[(*j).tour%2].nombre_batiments &lt; 3)
<a name="l00379"></a>00379                 {
<a name="l00380"></a>00380                         <span class="keywordflow">for</span>(i=0;i&lt;(*t).dimy;i++)
<a name="l00381"></a>00381                         {
<a name="l00382"></a>00382                                 <span class="keywordflow">for</span>(k=0;k&lt;(*t).dimx;k++) 
<a name="l00383"></a>00383                                 {
<a name="l00384"></a>00384                                         <a class="code" href="_jeu_8c.html#a719a70f9e4442b05627dda58da4e93db">AjouterMaisonJeu</a> (j, 1,k,i);
<a name="l00385"></a>00385                                 }
<a name="l00386"></a>00386                         }
<a name="l00387"></a>00387                 }
<a name="l00388"></a>00388                 <span class="keywordflow">for</span>(i=0;i&lt;(*t).dimy;i++)
<a name="l00389"></a>00389                 {
<a name="l00390"></a>00390                         <span class="keywordflow">for</span>(k=0;k&lt;(*t).dimx;k++) 
<a name="l00391"></a>00391                         {
<a name="l00392"></a>00392                                 
<a name="l00393"></a>00393                                 <span class="keywordflow">if</span> ((*t).cases[i*(*t).dimx+k].type_decor == 4 &amp;&amp; (*t).cases[i*(*t).dimx+k].groupe_decor == (*j).tour%2 &amp;&amp; (*t).cases[i*(*t).dimx+k].lunite == NULL)
<a name="l00394"></a>00394                         {
<a name="l00395"></a>00395                                 <span class="keywordflow">if</span> (nbpecheur == 0 &amp;&amp; (*j).tableau_de_joueurs[(*j).tour%2].nourriture &gt;= 50)
<a name="l00396"></a>00396                                 {
<a name="l00397"></a>00397                                         <a class="code" href="_cases_8c.html#add2687021c6d17fd31d5342b369d89ba">CreationUniteCases</a> (&amp;(*t).cases[i*(*t).dimx+k],2,(*j).tour%2);
<a name="l00398"></a>00398                                                 <a class="code" href="_joueur_8c.html#a8c2911062a76f7420d7c026d0f3a7811">ModificationReserveNourriture</a> (&amp;(*j).tableau_de_joueurs[(*j).tour%2],-50);
<a name="l00399"></a>00399                                                 <a class="code" href="_joueur_8c.html#a66002dd8effd92da1c264d87ea81f84b">ModificationNombreUnites</a> (&amp;(*j).tableau_de_joueurs[(*j).tour%2],1);
<a name="l00400"></a>00400                                                 nbpecheur++;
<a name="l00401"></a>00401                                 }
<a name="l00402"></a>00402                                 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (nbinfanterieinv2 &gt; 0 || nbinfanterieinv3 &gt; 0)
<a name="l00403"></a>00403                                 {
<a name="l00404"></a>00404                                         <span class="keywordflow">if</span> ((*j).tableau_de_joueurs[(*j).tour%2].nourriture &gt;= 200)
<a name="l00405"></a>00405                                         {
<a name="l00406"></a>00406                                                 <a class="code" href="_cases_8c.html#add2687021c6d17fd31d5342b369d89ba">CreationUniteCases</a> (&amp;(*t).cases[i*(*t).dimx+k],5,(*j).tour%2);
<a name="l00407"></a>00407                                                         <a class="code" href="_joueur_8c.html#a8c2911062a76f7420d7c026d0f3a7811">ModificationReserveNourriture</a> (&amp;(*j).tableau_de_joueurs[(*j).tour%2],-200);
<a name="l00408"></a>00408                                                         <a class="code" href="_joueur_8c.html#a66002dd8effd92da1c264d87ea81f84b">ModificationNombreUnites</a> (&amp;(*j).tableau_de_joueurs[(*j).tour%2],1);
<a name="l00409"></a>00409                                                         nbinfanterie3++;
<a name="l00410"></a>00410                                         }
<a name="l00411"></a>00411                                 }
<a name="l00412"></a>00412                                 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (nbinfanterieinv &gt; 1)
<a name="l00413"></a>00413                                 {
<a name="l00414"></a>00414                                         <span class="keywordflow">if</span> ((*j).tableau_de_joueurs[(*j).tour%2].nourriture &gt;= 150)
<a name="l00415"></a>00415                                         {
<a name="l00416"></a>00416                                                 <a class="code" href="_cases_8c.html#add2687021c6d17fd31d5342b369d89ba">CreationUniteCases</a> (&amp;(*t).cases[i*(*t).dimx+k],4,(*j).tour%2);
<a name="l00417"></a>00417                                                         <a class="code" href="_joueur_8c.html#a8c2911062a76f7420d7c026d0f3a7811">ModificationReserveNourriture</a> (&amp;(*j).tableau_de_joueurs[(*j).tour%2],-150);
<a name="l00418"></a>00418                                                         <a class="code" href="_joueur_8c.html#a66002dd8effd92da1c264d87ea81f84b">ModificationNombreUnites</a> (&amp;(*j).tableau_de_joueurs[(*j).tour%2],1);
<a name="l00419"></a>00419                                                         nbinfanterie2++;
<a name="l00420"></a>00420                                         }
<a name="l00421"></a>00421                                 }
<a name="l00422"></a>00422                                 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (nbbucheron == 0 &amp;&amp; (*j).tableau_de_joueurs[(*j).tour%2].nourriture &gt;= 50 &amp;&amp; nbarbre &gt; 0 &amp;&amp; (*j).tableau_de_joueurs[(*j).tour%2].nombre_batiments &lt; 3)
<a name="l00423"></a>00423                                 {
<a name="l00424"></a>00424                                         <a class="code" href="_cases_8c.html#add2687021c6d17fd31d5342b369d89ba">CreationUniteCases</a> (&amp;(*t).cases[i*(*t).dimx+k],1,(*j).tour%2);
<a name="l00425"></a>00425                                                 <a class="code" href="_joueur_8c.html#a8c2911062a76f7420d7c026d0f3a7811">ModificationReserveNourriture</a> (&amp;(*j).tableau_de_joueurs[(*j).tour%2],-50);
<a name="l00426"></a>00426                                                 <a class="code" href="_joueur_8c.html#a66002dd8effd92da1c264d87ea81f84b">ModificationNombreUnites</a> (&amp;(*j).tableau_de_joueurs[(*j).tour%2],1);
<a name="l00427"></a>00427                                                 nbbucheron++;
<a name="l00428"></a>00428                                 }
<a name="l00429"></a>00429                                 <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((*j).tableau_de_joueurs[(*j).tour%2].nourriture &gt;= 100)
<a name="l00430"></a>00430                                 {
<a name="l00431"></a>00431                                         
<a name="l00432"></a>00432                                         <a class="code" href="_cases_8c.html#add2687021c6d17fd31d5342b369d89ba">CreationUniteCases</a> (&amp;(*t).cases[i*(*t).dimx+k],3,(*j).tour%2);
<a name="l00433"></a>00433                                                 <a class="code" href="_joueur_8c.html#a8c2911062a76f7420d7c026d0f3a7811">ModificationReserveNourriture</a> (&amp;(*j).tableau_de_joueurs[(*j).tour%2],-100);
<a name="l00434"></a>00434                                                 <a class="code" href="_joueur_8c.html#a66002dd8effd92da1c264d87ea81f84b">ModificationNombreUnites</a> (&amp;(*j).tableau_de_joueurs[(*j).tour%2],1);
<a name="l00435"></a>00435                                 }
<a name="l00436"></a>00436                                 }
<a name="l00437"></a>00437                                 
<a name="l00438"></a>00438                         }
<a name="l00439"></a>00439                 }       
<a name="l00440"></a>00440         }
<a name="l00441"></a>00441 }
<a name="l00442"></a>00442 
<a name="l00443"></a>00443 
<a name="l00444"></a><a class="code" href="_jeu_8h.html#a334b718b43351269700b84847fc72a0b">00444</a> <span class="keywordtype">void</span> <a class="code" href="_jeu_8c.html#a334b718b43351269700b84847fc72a0b">Radar</a> (<a class="code" href="structs_jeu.html">Jeu</a> * j, <span class="keywordtype">int</span> x, <span class="keywordtype">int</span> y, <span class="keywordtype">int</span> <a class="code" href="structs_fleches_deplacement.html#a33f58a0f9f0fcded8bee7599d8bb1ead">type</a>)
<a name="l00445"></a>00445 {
<a name="l00446"></a>00446         <span class="keywordtype">int</span> i;
<a name="l00447"></a>00447         <span class="keywordtype">int</span> k;
<a name="l00448"></a>00448         <span class="keywordtype">int</span> retour;
<a name="l00449"></a>00449         <span class="keywordtype">int</span> xpos = -1;
<a name="l00450"></a>00450         <span class="keywordtype">int</span> ypos = -1;
<a name="l00451"></a>00451         <span class="keywordtype">int</span> position = 0;
<a name="l00452"></a>00452         <span class="keywordtype">int</span> deplacement = 0;
<a name="l00453"></a>00453         <span class="keywordtype">int</span> direction;
<a name="l00454"></a>00454         <span class="keywordtype">int</span> ok = 1;
<a name="l00455"></a>00455         <span class="keywordtype">int</span> x2 = x;
<a name="l00456"></a>00456         <span class="keywordtype">int</span> y2 = y;
<a name="l00457"></a>00457         <span class="keywordtype">int</span> maximum;
<a name="l00458"></a>00458         <a class="code" href="structs_terrain.html">Terrain</a> * t = <a class="code" href="_jeu_8c.html#a930e83c086fd3b04afb97fda5f3350ec">ObtientTerrainJeu</a>(j);
<a name="l00459"></a>00459         <a class="code" href="structs_cases.html">Cases</a> * cdepart = NULL;
<a name="l00460"></a>00460         <a class="code" href="structs_cases.html">Cases</a> * cfin = NULL;
<a name="l00461"></a>00461         <span class="keywordtype">int</span> * possibilite = (<span class="keywordtype">int</span>*) malloc ((*t).dimx * (*t).dimy *sizeof (<span class="keywordtype">int</span>));
<a name="l00462"></a>00462         assert(0&lt;=x &amp;&amp; x&lt;(*t).dimx);
<a name="l00463"></a>00463         assert(0&lt;=y &amp;&amp; y&lt;(*t).dimy);
<a name="l00464"></a>00464         assert(1&lt;=type &amp;&amp; type&lt;=3);
<a name="l00465"></a>00465         <a class="code" href="_jeu_8c.html#a579db13f3fb203cd8c4652e1386611b5">RemplissageMap</a>(j,possibilite,x,y,type,x,y);
<a name="l00466"></a>00466         <span class="keywordflow">for</span>(i = 0 ; i&lt; (*t).dimy ; i++)
<a name="l00467"></a>00467         {
<a name="l00468"></a>00468                 <span class="keywordflow">for</span> (k = 0 ; k &lt; (*t).dimx; k++)
<a name="l00469"></a>00469                 {
<a name="l00470"></a>00470                         <span class="keywordflow">if</span> (type == 2)
<a name="l00471"></a>00471                         {
<a name="l00472"></a>00472                                 <span class="keywordflow">if</span> ((*t).cases[i*(*t).dimx+k].type_decor == type||(*t).cases[i*(*t).dimx+k].type_decor == 5||(*t).cases[i*(*t).dimx+k].type_decor == 6||(*t).cases[i*(*t).dimx+k].type_decor == 7||(*t).cases[i*(*t).dimx+k].type_decor == 8)
<a name="l00473"></a>00473                                 {
<a name="l00474"></a>00474                                         <span class="keywordflow">if</span> (possibilite[i*(*t).dimx+k] &gt; position)
<a name="l00475"></a>00475                                         {
<a name="l00476"></a>00476                                                 xpos = k;
<a name="l00477"></a>00477                                                 ypos = i;
<a name="l00478"></a>00478                                                 position = possibilite[i*(*t).dimx+k];
<a name="l00479"></a>00479                                         }
<a name="l00480"></a>00480                                 }
<a name="l00481"></a>00481                         }
<a name="l00482"></a>00482                         <span class="keywordflow">else</span> <span class="keywordflow">if</span> (type == 1)
<a name="l00483"></a>00483                         {
<a name="l00484"></a>00484                                 <span class="keywordflow">if</span> ((*t).cases[i*(*t).dimx+k].type_decor == type)
<a name="l00485"></a>00485                                 {
<a name="l00486"></a>00486                                         <span class="keywordflow">if</span> (possibilite[i*(*t).dimx+k] &gt; position)
<a name="l00487"></a>00487                                         {
<a name="l00488"></a>00488                                                 xpos = k;
<a name="l00489"></a>00489                                                 ypos = i;
<a name="l00490"></a>00490                                         position = possibilite[i*(*t).dimx+k];
<a name="l00491"></a>00491                                         }
<a name="l00492"></a>00492                                 }
<a name="l00493"></a>00493                         }
<a name="l00494"></a>00494                         <span class="keywordflow">else</span>
<a name="l00495"></a>00495                         {
<a name="l00496"></a>00496                                 <span class="keywordflow">if</span> ((*t).cases[i*(*t).dimx+k].lunite != NULL)
<a name="l00497"></a>00497                                 {
<a name="l00498"></a>00498                                         <span class="keywordflow">if</span> ((*(*t).cases[i*(*t).dimx+k].lunite).equipe != (*j).tour %2)
<a name="l00499"></a>00499                                         {
<a name="l00500"></a>00500                                                 <span class="keywordflow">if</span> (possibilite[i*(*t).dimx+k] &gt; position)
<a name="l00501"></a>00501                                                 {
<a name="l00502"></a>00502                                                         xpos = k;
<a name="l00503"></a>00503                                                         ypos = i;
<a name="l00504"></a>00504                                                         position = possibilite[i*(*t).dimx+k];
<a name="l00505"></a>00505                                                 }
<a name="l00506"></a>00506                                         }
<a name="l00507"></a>00507                                 }
<a name="l00508"></a>00508                         }
<a name="l00509"></a>00509                 }
<a name="l00510"></a>00510         }
<a name="l00511"></a>00511         <span class="keywordflow">if</span> (!(xpos == -1 &amp;&amp; ypos == -1))
<a name="l00512"></a>00512         {
<a name="l00513"></a>00513          <a class="code" href="_jeu_8c.html#a579db13f3fb203cd8c4652e1386611b5">RemplissageMap</a>(j,possibilite,xpos,ypos,-1,x,y);
<a name="l00514"></a>00514         
<a name="l00515"></a>00515         deplacement = (*(*t).cases[y*(*t).dimx+x].lunite).deplacement;
<a name="l00516"></a>00516         ok = 1;
<a name="l00517"></a>00517         x2 = x;
<a name="l00518"></a>00518         y2 = y;
<a name="l00519"></a>00519         maximum = possibilite[y2*(*t).dimx+x2];
<a name="l00520"></a>00520         <span class="keywordflow">while</span> (deplacement &gt; 0 &amp;&amp; ok == 1)
<a name="l00521"></a>00521         {
<a name="l00522"></a>00522                 <span class="keywordflow">if</span> (1000 - maximum == 1)
<a name="l00523"></a>00523                 {
<a name="l00524"></a>00524                         ok = 0;
<a name="l00525"></a>00525                 }
<a name="l00526"></a>00526                 <span class="keywordflow">if</span> (ok == 1)
<a name="l00527"></a>00527                 {
<a name="l00528"></a>00528                 <span class="keywordflow">if</span> (y2 &gt; 0)
<a name="l00529"></a>00529                 {
<a name="l00530"></a>00530                         <span class="keywordflow">if</span> (possibilite[(y2-1)*(*t).dimx+x2] &gt; 0)
<a name="l00531"></a>00531                         {
<a name="l00532"></a>00532                                 maximum = possibilite[(y2-1)*(*t).dimx+x2];
<a name="l00533"></a>00533                                 direction = 2;
<a name="l00534"></a>00534                         }
<a name="l00535"></a>00535                 }
<a name="l00536"></a>00536                 <span class="keywordflow">if</span> (y2 &lt; (*t).dimy-1)
<a name="l00537"></a>00537                 {
<a name="l00538"></a>00538                         <span class="keywordflow">if</span> (possibilite[(y2+1)*(*t).dimx+x2] &gt; 0)
<a name="l00539"></a>00539                         {
<a name="l00540"></a>00540                                 <span class="keywordflow">if</span> (maximum &gt; 0)
<a name="l00541"></a>00541                                 {
<a name="l00542"></a>00542                                         <span class="keywordflow">if</span> (maximum &lt; possibilite[(y2+1)*(*t).dimx+x2])
<a name="l00543"></a>00543                                         {
<a name="l00544"></a>00544                                                 maximum = possibilite[(y2+1)*(*t).dimx+x2];
<a name="l00545"></a>00545                                                 direction = 4;
<a name="l00546"></a>00546                                         }
<a name="l00547"></a>00547                                 }
<a name="l00548"></a>00548                                 <span class="keywordflow">else</span>
<a name="l00549"></a>00549                                 {
<a name="l00550"></a>00550                                         maximum = possibilite[(y2+1)*(*t).dimx+x2];
<a name="l00551"></a>00551                                         direction = 4;
<a name="l00552"></a>00552                                 }
<a name="l00553"></a>00553                         }
<a name="l00554"></a>00554                 }
<a name="l00555"></a>00555                 <span class="keywordflow">if</span> (x2 &gt; 0)
<a name="l00556"></a>00556                 {
<a name="l00557"></a>00557                         <span class="keywordflow">if</span> (possibilite[y2*(*t).dimx+x2-1] &gt; 0)
<a name="l00558"></a>00558                         {
<a name="l00559"></a>00559                                 <span class="keywordflow">if</span> (maximum &gt; 0)
<a name="l00560"></a>00560                                 {
<a name="l00561"></a>00561                                         <span class="keywordflow">if</span> (maximum &lt; possibilite[y2*(*t).dimx+x2-1])
<a name="l00562"></a>00562                                         {
<a name="l00563"></a>00563                                                 maximum = possibilite[y2*(*t).dimx+x2-1];
<a name="l00564"></a>00564                                                 direction = 3;
<a name="l00565"></a>00565                                         }
<a name="l00566"></a>00566                                 }
<a name="l00567"></a>00567                                 <span class="keywordflow">else</span>
<a name="l00568"></a>00568                                 {
<a name="l00569"></a>00569                                         maximum = possibilite[y2*(*t).dimx+x2-1];
<a name="l00570"></a>00570                                         direction = 3;
<a name="l00571"></a>00571                                 }
<a name="l00572"></a>00572                         }
<a name="l00573"></a>00573                 }
<a name="l00574"></a>00574                 <span class="keywordflow">if</span> (x2 &lt; (*t).dimx -1)
<a name="l00575"></a>00575                 {
<a name="l00576"></a>00576                         <span class="keywordflow">if</span> (possibilite[y2*(*t).dimx+x2+1] &gt; 0)
<a name="l00577"></a>00577                         {
<a name="l00578"></a>00578                                 <span class="keywordflow">if</span> (maximum &gt; 0)
<a name="l00579"></a>00579                                 {
<a name="l00580"></a>00580                                         <span class="keywordflow">if</span> (maximum &lt; possibilite[y2*(*t).dimx+x2+1])
<a name="l00581"></a>00581                                         {
<a name="l00582"></a>00582                                                 maximum = possibilite[y2*(*t).dimx+x2+1];
<a name="l00583"></a>00583                                                 direction = 1;
<a name="l00584"></a>00584                                         }
<a name="l00585"></a>00585                                 }
<a name="l00586"></a>00586                                 <span class="keywordflow">else</span>
<a name="l00587"></a>00587                                 {
<a name="l00588"></a>00588                                         maximum = possibilite[y2*(*t).dimx+x2+1];
<a name="l00589"></a>00589                                         direction = 1;
<a name="l00590"></a>00590                                 }
<a name="l00591"></a>00591                         }
<a name="l00592"></a>00592                 }
<a name="l00593"></a>00593                 deplacement--;
<a name="l00594"></a>00594                 <span class="keywordflow">switch</span> (direction)
<a name="l00595"></a>00595                 {
<a name="l00596"></a>00596                         <span class="keywordflow">case</span> 1 :
<a name="l00597"></a>00597                                 x2++;
<a name="l00598"></a>00598                         <span class="keywordflow">break</span>;
<a name="l00599"></a>00599                         <span class="keywordflow">case</span> 2 :
<a name="l00600"></a>00600                                 y2--;
<a name="l00601"></a>00601                         <span class="keywordflow">break</span>;
<a name="l00602"></a>00602                         <span class="keywordflow">case</span> 3 :
<a name="l00603"></a>00603                                 x2--;
<a name="l00604"></a>00604                         <span class="keywordflow">break</span>;
<a name="l00605"></a>00605                         <span class="keywordflow">case</span> 4 :
<a name="l00606"></a>00606                                 y2++;
<a name="l00607"></a>00607                         <span class="keywordflow">break</span>;
<a name="l00608"></a>00608                 }
<a name="l00609"></a>00609                 }
<a name="l00610"></a>00610                 
<a name="l00611"></a>00611         }
<a name="l00612"></a>00612         
<a name="l00613"></a>00613         cdepart = <a class="code" href="_terrain_8c.html#a4216537a99d60dc6608fb6a3fb24daa8">ObtientCasesTerrain</a> (t, x, y);
<a name="l00614"></a>00614         cfin = <a class="code" href="_terrain_8c.html#a4216537a99d60dc6608fb6a3fb24daa8">ObtientCasesTerrain</a> (t, x2, y2);
<a name="l00615"></a>00615         <span class="keywordflow">if</span> (!(x == x2 &amp;&amp; y == y2))
<a name="l00616"></a>00616         {
<a name="l00617"></a>00617                 <a class="code" href="_cases_8c.html#a6653080275f128c807592b02d9178be5">DeplacementUniteCases</a> (cdepart, cfin);
<a name="l00618"></a>00618         }
<a name="l00619"></a>00619         <span class="keywordflow">if</span> (ok == 0)
<a name="l00620"></a>00620         {
<a name="l00621"></a>00621                 <span class="keywordflow">if</span> (type == 1)
<a name="l00622"></a>00622                 {
<a name="l00623"></a>00623                         <a class="code" href="_cases_8c.html#afa7f5bc3d7529b50515d2f065b1b3daa">ActionUniteCases</a>(cfin,&amp;(*t).cases[ypos*(*t).dimx+xpos],1);
<a name="l00624"></a>00624                         <a class="code" href="_joueur_8c.html#a1a4b66c02861ad5401b548b8166c06a3">ModificationReserveBois</a> (&amp;(*j).tableau_de_joueurs[(*j).tour%2],20);
<a name="l00625"></a>00625                 }
<a name="l00626"></a>00626                 <span class="keywordflow">if</span> (type == 2)
<a name="l00627"></a>00627                 {
<a name="l00628"></a>00628                         <a class="code" href="_joueur_8c.html#a8c2911062a76f7420d7c026d0f3a7811">ModificationReserveNourriture</a> (&amp;(*j).tableau_de_joueurs[(*j).tour%2],40);
<a name="l00629"></a>00629                 }
<a name="l00630"></a>00630                 <span class="keywordflow">if</span> (type == 3)
<a name="l00631"></a>00631                 {
<a name="l00632"></a>00632                         retour = <a class="code" href="_cases_8c.html#afa7f5bc3d7529b50515d2f065b1b3daa">ActionUniteCases</a>(cfin,&amp;(*t).cases[ypos*(*t).dimx+xpos],2);
<a name="l00633"></a>00633                         <span class="keywordflow">if</span> (retour == 1)
<a name="l00634"></a>00634                         {
<a name="l00635"></a>00635                                  <a class="code" href="_joueur_8c.html#a66002dd8effd92da1c264d87ea81f84b">ModificationNombreUnites</a>(&amp;(*j).tableau_de_joueurs[(*j).tour%2], -1);
<a name="l00636"></a>00636                         }
<a name="l00637"></a>00637                         <span class="keywordflow">else</span> <span class="keywordflow">if</span> (retour == 2)
<a name="l00638"></a>00638                         {
<a name="l00639"></a>00639                                  <a class="code" href="_joueur_8c.html#a66002dd8effd92da1c264d87ea81f84b">ModificationNombreUnites</a>(&amp;(*j).tableau_de_joueurs[((*j).tour+1)%2], -1);
<a name="l00640"></a>00640                         }
<a name="l00641"></a>00641                 }
<a name="l00642"></a>00642         }
<a name="l00643"></a>00643         }
<a name="l00644"></a>00644 }
<a name="l00645"></a>00645 
<a name="l00646"></a>00646 
<a name="l00647"></a><a class="code" href="_jeu_8h.html#a579db13f3fb203cd8c4652e1386611b5">00647</a> <span class="keywordtype">void</span> <a class="code" href="_jeu_8c.html#a579db13f3fb203cd8c4652e1386611b5">RemplissageMap</a> (<a class="code" href="structs_jeu.html">Jeu</a> * j, <span class="keywordtype">int</span> * possibilite, <span class="keywordtype">int</span> x, <span class="keywordtype">int</span> y, <span class="keywordtype">int</span> <a class="code" href="structs_fleches_deplacement.html#a33f58a0f9f0fcded8bee7599d8bb1ead">type</a>,<span class="keywordtype">int</span> x2, <span class="keywordtype">int</span> y2)
<a name="l00648"></a>00648 {
<a name="l00649"></a>00649         <a class="code" href="structs_terrain.html">Terrain</a> * t = <a class="code" href="_jeu_8c.html#a930e83c086fd3b04afb97fda5f3350ec">ObtientTerrainJeu</a> (j);
<a name="l00650"></a>00650         <span class="keywordtype">int</span> i;
<a name="l00651"></a>00651         <span class="keywordtype">int</span> k;
<a name="l00652"></a>00652         <span class="keywordtype">int</span> modification = 1;
<a name="l00653"></a>00653         <span class="keywordtype">int</span> maximum;
<a name="l00654"></a>00654         <span class="keywordflow">for</span> (i=0; i&lt;(*t).dimy; i++)
<a name="l00655"></a>00655         {
<a name="l00656"></a>00656                 <span class="keywordflow">for</span> (k=0; k&lt;(*t).dimx; k++)
<a name="l00657"></a>00657                 {
<a name="l00658"></a>00658                         <span class="keywordflow">if</span> (k == x &amp;&amp; i == y)
<a name="l00659"></a>00659                         {
<a name="l00660"></a>00660                                 possibilite[i*(*t).dimx+k] = 1000;
<a name="l00661"></a>00661                                 
<a name="l00662"></a>00662                         }
<a name="l00663"></a>00663                         <span class="keywordflow">else</span>
<a name="l00664"></a>00664                         {
<a name="l00665"></a>00665                                 possibilite[i*(*t).dimx+k] = 0;
<a name="l00666"></a>00666                         }
<a name="l00667"></a>00667                 }
<a name="l00668"></a>00668         }
<a name="l00669"></a>00669         <span class="keywordflow">while</span> (modification != 0)
<a name="l00670"></a>00670         {
<a name="l00671"></a>00671                 modification = 0;
<a name="l00672"></a>00672                 <span class="keywordflow">for</span> (i=0; i&lt; (*t).dimy; i++)
<a name="l00673"></a>00673                 {
<a name="l00674"></a>00674                         <span class="keywordflow">for</span> (k=0;k&lt;(*t).dimx;k++)
<a name="l00675"></a>00675                         {
<a name="l00676"></a>00676                                 maximum = 0;
<a name="l00677"></a>00677                                 <span class="keywordflow">if</span> (k &gt; 0)
<a name="l00678"></a>00678                                 {
<a name="l00679"></a>00679                                         <span class="keywordflow">if</span> (possibilite[i*(*t).dimx+k-1]&gt; 0)
<a name="l00680"></a>00680                                         {
<a name="l00681"></a>00681                                                 maximum = possibilite[i*(*t).dimx+k-1];
<a name="l00682"></a>00682                                         }
<a name="l00683"></a>00683                                 }
<a name="l00684"></a>00684                                 <span class="keywordflow">if</span> (i &gt; 0)
<a name="l00685"></a>00685                                 {
<a name="l00686"></a>00686                                         <span class="keywordflow">if</span> (possibilite[(i-1)*(*t).dimx+k] &gt; 0)
<a name="l00687"></a>00687                                         {
<a name="l00688"></a>00688                                                 <span class="keywordflow">if</span> (maximum == 0)
<a name="l00689"></a>00689                                                 {
<a name="l00690"></a>00690                                                         maximum = possibilite[(i-1)*(*t).dimx+k];
<a name="l00691"></a>00691                                                 }
<a name="l00692"></a>00692                                                 <span class="keywordflow">else</span>
<a name="l00693"></a>00693                                                 {
<a name="l00694"></a>00694                                                         <span class="keywordflow">if</span> (maximum &lt; possibilite[(i-1)*(*t).dimx+k])
<a name="l00695"></a>00695                                                         {
<a name="l00696"></a>00696                                                                 maximum = possibilite[(i-1)*(*t).dimx+k];
<a name="l00697"></a>00697                                                         }
<a name="l00698"></a>00698                                                 }
<a name="l00699"></a>00699                                         }
<a name="l00700"></a>00700                                 }
<a name="l00701"></a>00701                                 <span class="keywordflow">if</span> (i &lt; (*t).dimy-1)
<a name="l00702"></a>00702                                 {
<a name="l00703"></a>00703                                         <span class="keywordflow">if</span> (possibilite[(i+1)*(*t).dimx+k] &gt; 0)
<a name="l00704"></a>00704                                         {
<a name="l00705"></a>00705                                                 <span class="keywordflow">if</span> (maximum == 0)
<a name="l00706"></a>00706                                                 {
<a name="l00707"></a>00707                                                         maximum = possibilite[(i+1)*(*t).dimx+k];
<a name="l00708"></a>00708                                                 }
<a name="l00709"></a>00709                                                 <span class="keywordflow">else</span>
<a name="l00710"></a>00710                                                 {
<a name="l00711"></a>00711                                                         <span class="keywordflow">if</span> (maximum &lt; possibilite[(i+1)*(*t).dimx+k])
<a name="l00712"></a>00712                                                         {
<a name="l00713"></a>00713                                                                 maximum = possibilite[(i+1)*(*t).dimx+k];
<a name="l00714"></a>00714                                                         }
<a name="l00715"></a>00715                                                 }
<a name="l00716"></a>00716                                         }
<a name="l00717"></a>00717                                 }
<a name="l00718"></a>00718                                 <span class="keywordflow">if</span> (k &lt; (*t).dimx-1)
<a name="l00719"></a>00719                                 {
<a name="l00720"></a>00720                                         <span class="keywordflow">if</span> (possibilite[i*(*t).dimx+k+1] &gt; 0)
<a name="l00721"></a>00721                                         {
<a name="l00722"></a>00722                                                 <span class="keywordflow">if</span> (maximum == 0)
<a name="l00723"></a>00723                                                 {
<a name="l00724"></a>00724                                                         maximum = possibilite[i*(*t).dimx+k+1];
<a name="l00725"></a>00725                                                 }
<a name="l00726"></a>00726                                                 <span class="keywordflow">else</span>
<a name="l00727"></a>00727                                                 {
<a name="l00728"></a>00728                                                         <span class="keywordflow">if</span> (maximum &lt; possibilite[i*(*t).dimx+k+1])
<a name="l00729"></a>00729                                                         {
<a name="l00730"></a>00730                                                                 maximum = possibilite[i*(*t).dimx+k+1];
<a name="l00731"></a>00731                                                         }
<a name="l00732"></a>00732                                                 }
<a name="l00733"></a>00733                                         }
<a name="l00734"></a>00734                                 }
<a name="l00735"></a>00735                                 <span class="keywordflow">if</span> (maximum -1 &gt; 0 &amp;&amp; possibilite[i*(*t).dimx+k] == 0)
<a name="l00736"></a>00736                                 {
<a name="l00737"></a>00737                                         <span class="keywordflow">if</span> ((*t).cases[i*(*t).dimx+k].type_decor == 0 || (*t).cases[i*(*t).dimx+k].type_decor == 4)
<a name="l00738"></a>00738                                         {
<a name="l00739"></a>00739                                                 <span class="keywordflow">if</span> ((*t).cases[i*(*t).dimx+k].lunite != NULL)
<a name="l00740"></a>00740                                                 {
<a name="l00741"></a>00741                                                         <span class="keywordflow">if</span> (i == y2 &amp;&amp; k == x2)
<a name="l00742"></a>00742                                                         {
<a name="l00743"></a>00743                                                                 possibilite[i*(*t).dimx+k] = maximum - 1;
<a name="l00744"></a>00744                                                                 modification++;
<a name="l00745"></a>00745                                                         }
<a name="l00746"></a>00746                                                         <span class="keywordflow">else</span>
<a name="l00747"></a>00747                                                         {
<a name="l00748"></a>00748                                                                 <span class="keywordflow">if</span> ((*(*t).cases[i*(*t).dimx+k].lunite).equipe != (*j).tour%2 &amp;&amp; type == 3)
<a name="l00749"></a>00749                                                                 {
<a name="l00750"></a>00750                                                                         possibilite[i*(*t).dimx+k] = maximum - 1;
<a name="l00751"></a>00751                                                                         modification++;
<a name="l00752"></a>00752                                                                 }
<a name="l00753"></a>00753                                                                 <span class="keywordflow">else</span>
<a name="l00754"></a>00754                                                                 {
<a name="l00755"></a>00755                                                                         possibilite[i*(*t).dimx+k] = 0;
<a name="l00756"></a>00756                                                                 }
<a name="l00757"></a>00757                                                         }
<a name="l00758"></a>00758                                                 }
<a name="l00759"></a>00759                                                 <span class="keywordflow">else</span>
<a name="l00760"></a>00760                                                 {
<a name="l00761"></a>00761                                                         possibilite[i*(*t).dimx+k] = maximum - 1;
<a name="l00762"></a>00762                                                         modification++;
<a name="l00763"></a>00763                                                 }
<a name="l00764"></a>00764                                         }
<a name="l00765"></a>00765                                         <span class="keywordflow">else</span>
<a name="l00766"></a>00766                                         {
<a name="l00767"></a>00767                                                 <span class="keywordflow">if</span> (type == 2)
<a name="l00768"></a>00768                                                 {
<a name="l00769"></a>00769                                                         <span class="keywordflow">if</span> ((*t).cases[i*(*t).dimx+k].type_decor == type||(*t).cases[i*(*t).dimx+k].type_decor == 5||(*t).cases[i*(*t).dimx+k].type_decor == 6||(*t).cases[i*(*t).dimx+k].type_decor == 7||(*t).cases[i*(*t).dimx+k].type_decor == 8)
<a name="l00770"></a>00770                                                         {
<a name="l00771"></a>00771                                                                 possibilite[i*(*t).dimx+k] = maximum - 1;
<a name="l00772"></a>00772                                                                 modification++;
<a name="l00773"></a>00773                                                         }
<a name="l00774"></a>00774                                                 }
<a name="l00775"></a>00775                                                 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (type == 1)
<a name="l00776"></a>00776                                                 {
<a name="l00777"></a>00777                                                         <span class="keywordflow">if</span> ((*t).cases[i*(*t).dimx+k].type_decor == type)
<a name="l00778"></a>00778                                                         {
<a name="l00779"></a>00779                                                                 possibilite[i*(*t).dimx+k] = maximum - 1;
<a name="l00780"></a>00780                                                                 modification++;
<a name="l00781"></a>00781                                                         }
<a name="l00782"></a>00782                                                 }
<a name="l00783"></a>00783                                                 <span class="keywordflow">else</span>
<a name="l00784"></a>00784                                                 {
<a name="l00785"></a>00785                                                         possibilite[i*(*t).dimx+k] = 0;
<a name="l00786"></a>00786                                                 }
<a name="l00787"></a>00787                                         }
<a name="l00788"></a>00788 
<a name="l00789"></a>00789                                 }
<a name="l00790"></a>00790                         }
<a name="l00791"></a>00791                 }               
<a name="l00792"></a>00792         }
<a name="l00793"></a>00793         
<a name="l00794"></a>00794 }
<a name="l00795"></a>00795 
<a name="l00796"></a>00796 
<a name="l00797"></a><a class="code" href="_jeu_8h.html#a719a70f9e4442b05627dda58da4e93db">00797</a> <span class="keywordtype">void</span> <a class="code" href="_jeu_8c.html#a719a70f9e4442b05627dda58da4e93db">AjouterMaisonJeu</a> (<a class="code" href="structs_jeu.html">Jeu</a> * j, <span class="keywordtype">int</span> selectionmaison, <span class="keywordtype">int</span> x,<span class="keywordtype">int</span> y)
<a name="l00798"></a>00798 {
<a name="l00799"></a>00799         <a class="code" href="structs_terrain.html">Terrain</a> * t = <a class="code" href="_jeu_8c.html#a930e83c086fd3b04afb97fda5f3350ec">ObtientTerrainJeu</a> (j);
<a name="l00800"></a>00800         <a class="code" href="structs_cases.html">Cases</a> * c = <a class="code" href="_terrain_8c.html#a4216537a99d60dc6608fb6a3fb24daa8">ObtientCasesTerrain</a> (t,x,y);
<a name="l00801"></a>00801         <a class="code" href="structs_cases.html">Cases</a> * c2;
<a name="l00802"></a>00802         <span class="keywordtype">int</span> ok =0;
<a name="l00803"></a>00803         assert(0&lt;=x &amp;&amp; x&lt;(*t).dimx);
<a name="l00804"></a>00804         assert(0&lt;=y &amp;&amp; y&lt;(*t).dimy);
<a name="l00805"></a>00805         
<a name="l00806"></a>00806         <span class="keywordflow">if</span> (x &gt; 0)
<a name="l00807"></a>00807         {
<a name="l00808"></a>00808                 c2 = <a class="code" href="_terrain_8c.html#a4216537a99d60dc6608fb6a3fb24daa8">ObtientCasesTerrain</a> (t,x-1,y);
<a name="l00809"></a>00809                 <span class="keywordflow">if</span> ((*c2).lunite != NULL)
<a name="l00810"></a>00810                 {
<a name="l00811"></a>00811                         <span class="keywordflow">if</span> ((*(*c2).lunite).equipe == (*j).tour%2)
<a name="l00812"></a>00812                         {
<a name="l00813"></a>00813                                 ok++;
<a name="l00814"></a>00814                         }
<a name="l00815"></a>00815                 }
<a name="l00816"></a>00816         }
<a name="l00817"></a>00817         <span class="keywordflow">if</span> (y &gt; 0)
<a name="l00818"></a>00818         {
<a name="l00819"></a>00819                 c2 = <a class="code" href="_terrain_8c.html#a4216537a99d60dc6608fb6a3fb24daa8">ObtientCasesTerrain</a> (t,x,y-1);
<a name="l00820"></a>00820                 <span class="keywordflow">if</span> ((*c2).lunite != NULL)
<a name="l00821"></a>00821                 {
<a name="l00822"></a>00822                         <span class="keywordflow">if</span> ((*(*c2).lunite).equipe == (*j).tour%2)
<a name="l00823"></a>00823                         {
<a name="l00824"></a>00824                                 ok++;
<a name="l00825"></a>00825                         }
<a name="l00826"></a>00826                 }       
<a name="l00827"></a>00827         }
<a name="l00828"></a>00828         <span class="keywordflow">if</span> (x &lt; (*t).dimx-1)
<a name="l00829"></a>00829         {
<a name="l00830"></a>00830                 c2 = <a class="code" href="_terrain_8c.html#a4216537a99d60dc6608fb6a3fb24daa8">ObtientCasesTerrain</a> (t,x+1,y);
<a name="l00831"></a>00831                 <span class="keywordflow">if</span> ((*c2).lunite != NULL)
<a name="l00832"></a>00832                 {
<a name="l00833"></a>00833                         <span class="keywordflow">if</span> ((*(*c2).lunite).equipe == (*j).tour%2)
<a name="l00834"></a>00834                         {
<a name="l00835"></a>00835                                 ok++;
<a name="l00836"></a>00836                         }
<a name="l00837"></a>00837                 }       
<a name="l00838"></a>00838         }
<a name="l00839"></a>00839         <span class="keywordflow">if</span> (y &lt; (*t).dimy-1)
<a name="l00840"></a>00840         {
<a name="l00841"></a>00841                 c2 = <a class="code" href="_terrain_8c.html#a4216537a99d60dc6608fb6a3fb24daa8">ObtientCasesTerrain</a> (t,x,y+1);
<a name="l00842"></a>00842                 <span class="keywordflow">if</span> ((*c2).lunite != NULL)
<a name="l00843"></a>00843                 {
<a name="l00844"></a>00844                         <span class="keywordflow">if</span> ((*(*c2).lunite).equipe == (*j).tour%2)
<a name="l00845"></a>00845                         {
<a name="l00846"></a>00846                                 ok++;
<a name="l00847"></a>00847                         }
<a name="l00848"></a>00848                 }       
<a name="l00849"></a>00849         }
<a name="l00850"></a>00850         <span class="keywordflow">if</span> ((*c).type_decor == 0 &amp;&amp; (*c).lunite == NULL &amp;&amp; ok != 0)
<a name="l00851"></a>00851         {
<a name="l00852"></a>00852                 <span class="keywordflow">if</span> (selectionmaison == 1 &amp;&amp; (*j).tableau_de_joueurs[(*j).tour%2].bois &gt;= 100)
<a name="l00853"></a>00853                 {
<a name="l00854"></a>00854                         <a class="code" href="_cases_8c.html#a6eee1057f6463a6cb9afbc6c83ee4419">ModificationDecor</a> (c, 3, (*j).tour%2);
<a name="l00855"></a>00855                         <a class="code" href="_joueur_8c.html#a1a4b66c02861ad5401b548b8166c06a3">ModificationReserveBois</a> (&amp;(*j).tableau_de_joueurs[(*j).tour%2],-100);
<a name="l00856"></a>00856                         <a class="code" href="_joueur_8c.html#a186a1fdbdbd3936040d55abb0f9c0d9b">ModificationNombreBatiments</a> (&amp;(*j).tableau_de_joueurs[(*j).tour%2],1);
<a name="l00857"></a>00857                  }
<a name="l00858"></a>00858         }
<a name="l00859"></a>00859 }
<a name="l00860"></a>00860 
<a name="l00861"></a>00861 
<a name="l00862"></a><a class="code" href="_jeu_8h.html#a2d408900612a87bf42d3e45e46fd2fd5">00862</a> <span class="keywordtype">void</span> <a class="code" href="_jeu_8c.html#a2d408900612a87bf42d3e45e46fd2fd5">SauvegardeJeu</a>(<a class="code" href="structs_jeu.html">Jeu</a> * j, <span class="keyword">const</span> <span class="keywordtype">char</span> * nomfic)
<a name="l00863"></a>00863 {
<a name="l00864"></a>00864         <span class="keywordtype">int</span> i;
<a name="l00865"></a>00865         <span class="keywordtype">int</span> k;
<a name="l00866"></a>00866         <span class="keywordtype">int</span> recup;
<a name="l00867"></a>00867         <span class="keywordtype">float</span> recup2;
<a name="l00868"></a>00868         FILE * fic = fopen(nomfic,<span class="stringliteral">&quot;w&quot;</span>);
<a name="l00869"></a>00869         <span class="keyword">const</span> <a class="code" href="structs_terrain.html">Terrain</a> * t = <a class="code" href="_jeu_8c.html#a870adf9b0857e5fd443c1de05a04952b">ObtientTerrainConstJeu</a>(j);
<a name="l00870"></a>00870         <span class="keywordflow">if</span>(fic == NULL)
<a name="l00871"></a>00871         {
<a name="l00872"></a>00872                 printf(<span class="stringliteral">&quot;ERROR \n&quot;</span>);
<a name="l00873"></a>00873                 exit(EXIT_FAILURE);     
<a name="l00874"></a>00874         }
<a name="l00875"></a>00875         
<a name="l00876"></a>00876         recup = (*j).tour;
<a name="l00877"></a>00877         fprintf(fic ,<span class="stringliteral">&quot;%d\n\n&quot;</span>, recup);
<a name="l00878"></a>00878         
<a name="l00879"></a>00879         recup = (*t).dimy;
<a name="l00880"></a>00880         fprintf(fic ,<span class="stringliteral">&quot;%d &quot;</span>, recup);
<a name="l00881"></a>00881         recup = (*t).dimx;
<a name="l00882"></a>00882         fprintf(fic ,<span class="stringliteral">&quot;%d\n\n&quot;</span>, recup);
<a name="l00883"></a>00883         
<a name="l00884"></a>00884         recup = (*j).mapencours;
<a name="l00885"></a>00885         fprintf(fic ,<span class="stringliteral">&quot;%d\n\n&quot;</span>, recup);
<a name="l00886"></a>00886         
<a name="l00887"></a>00887         recup = (*j).tableau_de_joueurs[0].bois;
<a name="l00888"></a>00888         fprintf(fic ,<span class="stringliteral">&quot;%d &quot;</span>, recup);
<a name="l00889"></a>00889         recup = (*j).tableau_de_joueurs[0].nourriture;
<a name="l00890"></a>00890         fprintf(fic ,<span class="stringliteral">&quot;%d &quot;</span>, recup);
<a name="l00891"></a>00891         recup = (*j).tableau_de_joueurs[0].nombre_unites;
<a name="l00892"></a>00892         fprintf(fic ,<span class="stringliteral">&quot;%d &quot;</span>, recup);
<a name="l00893"></a>00893         recup = (*j).tableau_de_joueurs[0].nombre_batiments;
<a name="l00894"></a>00894         fprintf(fic ,<span class="stringliteral">&quot;%d &quot;</span>, recup);
<a name="l00895"></a>00895         recup = (*j).tableau_de_joueurs[0].joueur_ou_IA;
<a name="l00896"></a>00896         fprintf(fic ,<span class="stringliteral">&quot;%d\n\n&quot;</span>, recup);
<a name="l00897"></a>00897         
<a name="l00898"></a>00898         recup = (*j).tableau_de_joueurs[1].bois;
<a name="l00899"></a>00899         fprintf(fic ,<span class="stringliteral">&quot;%d &quot;</span>, recup);
<a name="l00900"></a>00900         recup = (*j).tableau_de_joueurs[1].nourriture;
<a name="l00901"></a>00901         fprintf(fic ,<span class="stringliteral">&quot;%d &quot;</span>, recup);
<a name="l00902"></a>00902         recup = (*j).tableau_de_joueurs[1].nombre_unites;
<a name="l00903"></a>00903         fprintf(fic ,<span class="stringliteral">&quot;%d &quot;</span>, recup);
<a name="l00904"></a>00904         recup = (*j).tableau_de_joueurs[1].nombre_batiments;
<a name="l00905"></a>00905         fprintf(fic ,<span class="stringliteral">&quot;%d &quot;</span>, recup);
<a name="l00906"></a>00906         recup = (*j).tableau_de_joueurs[1].joueur_ou_IA;
<a name="l00907"></a>00907         fprintf(fic ,<span class="stringliteral">&quot;%d\n\n&quot;</span>, recup);
<a name="l00908"></a>00908         
<a name="l00909"></a>00909         
<a name="l00910"></a>00910         <span class="keywordflow">for</span> (i=0; i&lt; (*t).dimy;i++)
<a name="l00911"></a>00911         {
<a name="l00912"></a>00912                 <span class="keywordflow">for</span> (k=0; k&lt; (*t).dimx; k++)
<a name="l00913"></a>00913                 {
<a name="l00914"></a>00914                         
<a name="l00915"></a>00915                         recup = (*t).cases[i*(*t).dimx+k].type_decor;
<a name="l00916"></a>00916                         fprintf(fic ,<span class="stringliteral">&quot;%d &quot;</span>, recup);
<a name="l00917"></a>00917                         recup = (*t).cases[i*(*t).dimx+k].vie;
<a name="l00918"></a>00918                         fprintf(fic ,<span class="stringliteral">&quot;%d &quot;</span>, recup);
<a name="l00919"></a>00919                         recup = (*t).cases[i*(*t).dimx+k].groupe_decor;
<a name="l00920"></a>00920                         fprintf(fic ,<span class="stringliteral">&quot;%d\n&quot;</span>, recup);
<a name="l00921"></a>00921                 }
<a name="l00922"></a>00922                 fprintf(fic ,<span class="stringliteral">&quot;\n&quot;</span>);
<a name="l00923"></a>00923         }
<a name="l00924"></a>00924         <span class="keywordflow">for</span> (i=0; i&lt; (*t).dimy;i++)
<a name="l00925"></a>00925         {
<a name="l00926"></a>00926                 <span class="keywordflow">for</span> (k=0; k&lt; (*t).dimx; k++)
<a name="l00927"></a>00927                 {
<a name="l00928"></a>00928                         <span class="keywordflow">if</span> ((*t).cases[i*(*t).dimx+k].lunite == NULL)
<a name="l00929"></a>00929                         {
<a name="l00930"></a>00930                                 fprintf(fic ,<span class="stringliteral">&quot;0\n&quot;</span>);
<a name="l00931"></a>00931                         }
<a name="l00932"></a>00932                         <span class="keywordflow">else</span>
<a name="l00933"></a>00933                         {
<a name="l00934"></a>00934                                 recup = (*(*t).cases[i*(*t).dimx+k].lunite).<a class="code" href="structs_fleches_deplacement.html#a33f58a0f9f0fcded8bee7599d8bb1ead">type</a>;
<a name="l00935"></a>00935                                 fprintf(fic ,<span class="stringliteral">&quot;%d &quot;</span>, recup);
<a name="l00936"></a>00936                                 recup = (*(*t).cases[i*(*t).dimx+k].lunite).vie;
<a name="l00937"></a>00937                                 fprintf(fic ,<span class="stringliteral">&quot;%d &quot;</span>, recup);
<a name="l00938"></a>00938                                 recup2 = (*(*t).cases[i*(*t).dimx+k].lunite).attaque;
<a name="l00939"></a>00939                                 fprintf(fic ,<span class="stringliteral">&quot;%f &quot;</span>, recup2);
<a name="l00940"></a>00940                                 recup = (*(*t).cases[i*(*t).dimx+k].lunite).defense;
<a name="l00941"></a>00941                                 fprintf(fic ,<span class="stringliteral">&quot;%d &quot;</span>, recup);
<a name="l00942"></a>00942                                 recup = (*(*t).cases[i*(*t).dimx+k].lunite).deplacement;
<a name="l00943"></a>00943                                 fprintf(fic ,<span class="stringliteral">&quot;%d &quot;</span>, recup);
<a name="l00944"></a>00944                                 recup = (*(*t).cases[i*(*t).dimx+k].lunite).equipe;
<a name="l00945"></a>00945                                 fprintf(fic ,<span class="stringliteral">&quot;%d &quot;</span>, recup);
<a name="l00946"></a>00946                                 recup = (*(*t).cases[i*(*t).dimx+k].lunite).utilise;
<a name="l00947"></a>00947                                 fprintf(fic ,<span class="stringliteral">&quot;%d\n&quot;</span>, recup);
<a name="l00948"></a>00948                                 
<a name="l00949"></a>00949                         }
<a name="l00950"></a>00950                 }
<a name="l00951"></a>00951                 fprintf(fic ,<span class="stringliteral">&quot;\n&quot;</span>);
<a name="l00952"></a>00952         }
<a name="l00953"></a>00953         fclose(fic);
<a name="l00954"></a>00954 }
<a name="l00955"></a>00955 
<a name="l00956"></a><a class="code" href="_jeu_8h.html#a45178e95e179e9d0175efa9c4fed4126">00956</a> <span class="keywordtype">int</span> <a class="code" href="_jeu_8c.html#a45178e95e179e9d0175efa9c4fed4126">VerificationMapFaite</a>(<a class="code" href="structs_jeu.html">Jeu</a> * j, <span class="keyword">const</span> <span class="keywordtype">char</span> * nomfic)
<a name="l00957"></a>00957 {
<a name="l00958"></a>00958         FILE * fic = fopen(nomfic,<span class="stringliteral">&quot;r&quot;</span>);
<a name="l00959"></a>00959         <span class="keywordtype">int</span> ok = 1;
<a name="l00960"></a>00960         <span class="keywordtype">int</span> nb = 0;
<a name="l00961"></a>00961         <span class="keywordtype">int</span> recup;
<a name="l00962"></a>00962         
<a name="l00963"></a>00963         <span class="keywordflow">if</span>(fic != NULL)
<a name="l00964"></a>00964         {
<a name="l00965"></a>00965                 <span class="keywordflow">while</span> (ok == 1)
<a name="l00966"></a>00966                 {
<a name="l00967"></a>00967                         ok = fscanf(fic ,<span class="stringliteral">&quot;%d\n&quot;</span>, &amp;recup);
<a name="l00968"></a>00968                         <span class="keywordflow">if</span> (ok != -1)
<a name="l00969"></a>00969                         {
<a name="l00970"></a>00970                                 <span class="keywordflow">if</span> (recup == (*j).mapencours)
<a name="l00971"></a>00971                                 {
<a name="l00972"></a>00972                                         ok = 0;
<a name="l00973"></a>00973                                 }
<a name="l00974"></a>00974                                 nb++;
<a name="l00975"></a>00975                         }
<a name="l00976"></a>00976                 }
<a name="l00977"></a>00977                 
<a name="l00978"></a>00978                 <span class="keywordflow">if</span> (ok == -1)
<a name="l00979"></a>00979                 {
<a name="l00980"></a>00980                         <span class="keywordflow">if</span> ((*j).mapencours != 10)
<a name="l00981"></a>00981                         {
<a name="l00982"></a>00982                                 fclose(fic);
<a name="l00983"></a>00983                                 fic = fopen(nomfic,<span class="stringliteral">&quot;a&quot;</span>);
<a name="l00984"></a>00984                                 fprintf(fic ,<span class="stringliteral">&quot;%d\n&quot;</span>, (*j).mapencours);
<a name="l00985"></a>00985                                 fclose(fic);
<a name="l00986"></a>00986                                 nb++;
<a name="l00987"></a>00987                                 <span class="keywordflow">if</span> (nb == 8)
<a name="l00988"></a>00988                                 {       
<a name="l00989"></a>00989                                         <span class="keywordflow">return</span> 1;
<a name="l00990"></a>00990                                 }
<a name="l00991"></a>00991                         }
<a name="l00992"></a>00992                 }
<a name="l00993"></a>00993         }
<a name="l00994"></a>00994         <span class="keywordflow">else</span>
<a name="l00995"></a>00995         {
<a name="l00996"></a>00996                 <span class="keywordflow">if</span> ((*j).mapencours != 10)
<a name="l00997"></a>00997                 {
<a name="l00998"></a>00998                         fic = fopen(nomfic,<span class="stringliteral">&quot;a&quot;</span>);
<a name="l00999"></a>00999                         fprintf(fic ,<span class="stringliteral">&quot;%d\n&quot;</span>, (*j).mapencours);
<a name="l01000"></a>01000                         fclose(fic);
<a name="l01001"></a>01001                 }
<a name="l01002"></a>01002         }
<a name="l01003"></a>01003         <span class="keywordflow">return</span> 0;
<a name="l01004"></a>01004 }
<a name="l01005"></a>01005 
<a name="l01006"></a><a class="code" href="_jeu_8h.html#ad67d03c9ee6a368322513e012a820b02">01006</a> <span class="keywordtype">void</span> <a class="code" href="_jeu_8c.html#ad67d03c9ee6a368322513e012a820b02">ChargementMapFaite</a>(<a class="code" href="structs_jeu.html">Jeu</a> * j,<span class="keywordtype">int</span> tableaumap[8],<span class="keyword">const</span> <span class="keywordtype">char</span> * nomfic)
<a name="l01007"></a>01007 {
<a name="l01008"></a>01008         FILE * fic = fopen(nomfic,<span class="stringliteral">&quot;r&quot;</span>);
<a name="l01009"></a>01009         <span class="keywordtype">int</span> i;
<a name="l01010"></a>01010         <span class="keywordtype">int</span> recup;
<a name="l01011"></a>01011         <span class="keywordtype">int</span> ok = 1;
<a name="l01012"></a>01012         <span class="keywordflow">for</span> (i =0; i&lt; 8; i++)
<a name="l01013"></a>01013         {
<a name="l01014"></a>01014                 tableaumap[i] = 0;
<a name="l01015"></a>01015         }
<a name="l01016"></a>01016         <span class="keywordflow">if</span>(fic != NULL)
<a name="l01017"></a>01017         {
<a name="l01018"></a>01018                 <span class="keywordflow">while</span> (ok == 1)
<a name="l01019"></a>01019                 {
<a name="l01020"></a>01020                         ok = fscanf(fic ,<span class="stringliteral">&quot;%d\n&quot;</span>, &amp;recup);
<a name="l01021"></a>01021                         <span class="keywordflow">if</span> (ok != -1)
<a name="l01022"></a>01022                         {
<a name="l01023"></a>01023                                 tableaumap[recup-1] = 1;
<a name="l01024"></a>01024                                 
<a name="l01025"></a>01025                         }
<a name="l01026"></a>01026                         
<a name="l01027"></a>01027                 }
<a name="l01028"></a>01028                 fclose(fic);
<a name="l01029"></a>01029         }
<a name="l01030"></a>01030 }
<a name="l01031"></a>01031 
<a name="l01032"></a><a class="code" href="_jeu_8h.html#abc90de1f212065672393a22c18e12a22">01032</a> <span class="keywordtype">void</span> <a class="code" href="_jeu_8c.html#abc90de1f212065672393a22c18e12a22">SauvegardeOption</a> (<span class="keywordtype">int</span> musique, <span class="keywordtype">int</span> bruitage, <span class="keyword">const</span> <span class="keywordtype">char</span> * nomfic)
<a name="l01033"></a>01033 {
<a name="l01034"></a>01034         FILE * fic = fopen(nomfic,<span class="stringliteral">&quot;w&quot;</span>);
<a name="l01035"></a>01035         <span class="keywordflow">if</span>(fic == NULL)
<a name="l01036"></a>01036         {
<a name="l01037"></a>01037                 printf(<span class="stringliteral">&quot;ERROR \n&quot;</span>);
<a name="l01038"></a>01038                 exit(EXIT_FAILURE);     
<a name="l01039"></a>01039         }
<a name="l01040"></a>01040         <span class="keywordflow">else</span>
<a name="l01041"></a>01041         {
<a name="l01042"></a>01042                 fprintf(fic ,<span class="stringliteral">&quot;%d %d&quot;</span>, musique,bruitage);
<a name="l01043"></a>01043         }
<a name="l01044"></a>01044         fclose(fic);
<a name="l01045"></a>01045 }
<a name="l01046"></a>01046 
<a name="l01047"></a><a class="code" href="_jeu_8h.html#ad1e508be00d1482206aa16ec73353e89">01047</a> <span class="keywordtype">void</span> <a class="code" href="_jeu_8c.html#ad1e508be00d1482206aa16ec73353e89">ChargementOption</a> (<span class="keywordtype">int</span> * musique, <span class="keywordtype">int</span> * bruitage, <span class="keyword">const</span> <span class="keywordtype">char</span> * nomfic)
<a name="l01048"></a>01048 {
<a name="l01049"></a>01049         FILE * fic = fopen(nomfic,<span class="stringliteral">&quot;r&quot;</span>);
<a name="l01050"></a>01050         <span class="keywordtype">int</span> recup;
<a name="l01051"></a>01051         <span class="keywordflow">if</span>(fic == NULL)
<a name="l01052"></a>01052         {
<a name="l01053"></a>01053                 fclose(fic);
<a name="l01054"></a>01054                 fic = fopen(nomfic,<span class="stringliteral">&quot;w&quot;</span>);
<a name="l01055"></a>01055                 <span class="keywordflow">if</span>(fic == NULL)
<a name="l01056"></a>01056                 {
<a name="l01057"></a>01057                         printf(<span class="stringliteral">&quot;ERROR \n&quot;</span>);
<a name="l01058"></a>01058                         exit(EXIT_FAILURE);     
<a name="l01059"></a>01059                 }
<a name="l01060"></a>01060                 <span class="keywordflow">else</span>
<a name="l01061"></a>01061                 {
<a name="l01062"></a>01062                         fprintf(fic ,<span class="stringliteral">&quot;%d %d&quot;</span>, 1,1);
<a name="l01063"></a>01063                         *musique = 1;
<a name="l01064"></a>01064                         *bruitage = 1;
<a name="l01065"></a>01065                 }
<a name="l01066"></a>01066         }
<a name="l01067"></a>01067         <span class="keywordflow">else</span>
<a name="l01068"></a>01068         {
<a name="l01069"></a>01069                 fscanf(fic ,<span class="stringliteral">&quot;%d &quot;</span>,&amp;recup);
<a name="l01070"></a>01070                 *musique = recup;
<a name="l01071"></a>01071                 fscanf(fic ,<span class="stringliteral">&quot;%d &quot;</span>,&amp;recup);
<a name="l01072"></a>01072                 *bruitage = recup;
<a name="l01073"></a>01073         }
<a name="l01074"></a>01074         fclose(fic);
<a name="l01075"></a>01075 }
<a name="l01076"></a><a class="code" href="_jeu_8h.html#af21746af96c7c06b15c0397d3970ca2b">01076</a> <span class="keywordtype">void</span> <a class="code" href="_jeu_8c.html#af21746af96c7c06b15c0397d3970ca2b">VidageMapFaite</a>(<span class="keyword">const</span> <span class="keywordtype">char</span> * nomfic)
<a name="l01077"></a>01077 {
<a name="l01078"></a>01078         <span class="keyword">remove</span>(nomfic);
<a name="l01079"></a>01079 }
<a name="l01080"></a>01080 
<a name="l01081"></a>01081 
<a name="l01082"></a><a class="code" href="_jeu_8h.html#a9b2e780e79bb0ea6d25363604b33b6ff">01082</a> <span class="keywordtype">void</span> <a class="code" href="_jeu_8c.html#a9b2e780e79bb0ea6d25363604b33b6ff">AjouterDecorEditeurJeu</a> (<a class="code" href="structs_jeu.html">Jeu</a> * j, <span class="keywordtype">int</span> selection, <span class="keywordtype">int</span> x,<span class="keywordtype">int</span> y)
<a name="l01083"></a>01083 {
<a name="l01084"></a>01084         <a class="code" href="structs_terrain.html">Terrain</a> * t = <a class="code" href="_jeu_8c.html#a930e83c086fd3b04afb97fda5f3350ec">ObtientTerrainJeu</a> (j);
<a name="l01085"></a>01085         <a class="code" href="structs_cases.html">Cases</a> * c = <a class="code" href="_terrain_8c.html#a4216537a99d60dc6608fb6a3fb24daa8">ObtientCasesTerrain</a> (t,x,y);
<a name="l01086"></a>01086         
<a name="l01087"></a>01087         assert(0&lt;=x &amp;&amp; x&lt;(*t).dimx);
<a name="l01088"></a>01088         assert(0&lt;=y &amp;&amp; y&lt;(*t).dimy);
<a name="l01089"></a>01089         <span class="keywordflow">if</span> ((*c).lunite == NULL)
<a name="l01090"></a>01090         {
<a name="l01091"></a>01091                 <span class="keywordflow">switch</span> (selection)
<a name="l01092"></a>01092                 {
<a name="l01093"></a>01093                         <span class="keywordflow">case</span> 1 :
<a name="l01094"></a>01094                                 <a class="code" href="_cases_8c.html#a6eee1057f6463a6cb9afbc6c83ee4419">ModificationDecor</a> (c, 0, 0);
<a name="l01095"></a>01095                         <span class="keywordflow">break</span>;
<a name="l01096"></a>01096                         <span class="keywordflow">case</span> 2 :
<a name="l01097"></a>01097                                 <a class="code" href="_cases_8c.html#a6eee1057f6463a6cb9afbc6c83ee4419">ModificationDecor</a> (c, 1, 0);
<a name="l01098"></a>01098                         <span class="keywordflow">break</span>;
<a name="l01099"></a>01099                         <span class="keywordflow">case</span> 3 :
<a name="l01100"></a>01100                                 <a class="code" href="_cases_8c.html#a6eee1057f6463a6cb9afbc6c83ee4419">ModificationDecor</a> (c, 2, 0);
<a name="l01101"></a>01101                         <span class="keywordflow">break</span>;
<a name="l01102"></a>01102                         <span class="keywordflow">case</span> 4 :
<a name="l01103"></a>01103                                 <a class="code" href="_cases_8c.html#a6eee1057f6463a6cb9afbc6c83ee4419">ModificationDecor</a> (c, 9, 0);
<a name="l01104"></a>01104                         <span class="keywordflow">break</span>;
<a name="l01105"></a>01105                         
<a name="l01106"></a>01106                 }
<a name="l01107"></a>01107         }       
<a name="l01108"></a>01108 }
<a name="l01109"></a>01109 
<a name="l01110"></a><a class="code" href="_jeu_8h.html#aa269251bb35cb35917c8a00736884d01">01110</a> <span class="keywordtype">void</span> <a class="code" href="_jeu_8c.html#aa269251bb35cb35917c8a00736884d01">AjouterUniteEditeurJeu</a> (<a class="code" href="structs_jeu.html">Jeu</a> * j, <span class="keywordtype">int</span> selection, <span class="keywordtype">int</span> x,<span class="keywordtype">int</span> y)
<a name="l01111"></a>01111 {
<a name="l01112"></a>01112         <a class="code" href="structs_terrain.html">Terrain</a> * t = <a class="code" href="_jeu_8c.html#a930e83c086fd3b04afb97fda5f3350ec">ObtientTerrainJeu</a> (j);
<a name="l01113"></a>01113         <a class="code" href="structs_cases.html">Cases</a> * c = <a class="code" href="_terrain_8c.html#a4216537a99d60dc6608fb6a3fb24daa8">ObtientCasesTerrain</a> (t,x,y);
<a name="l01114"></a>01114         
<a name="l01115"></a>01115         assert(0&lt;=x &amp;&amp; x&lt;(*t).dimx);
<a name="l01116"></a>01116         assert(0&lt;=y &amp;&amp; y&lt;(*t).dimy);
<a name="l01117"></a>01117         <span class="keywordflow">if</span> ((*c).type_decor == 0)
<a name="l01118"></a>01118         {
<a name="l01119"></a>01119                 <span class="keywordflow">if</span> (selection == 0)
<a name="l01120"></a>01120                 {
<a name="l01121"></a>01121                         <span class="keywordflow">if</span> ((*c).lunite != NULL)
<a name="l01122"></a>01122                         {
<a name="l01123"></a>01123                                 <a class="code" href="_joueur_8c.html#a66002dd8effd92da1c264d87ea81f84b">ModificationNombreUnites</a> (&amp;(*j).tableau_de_joueurs[(*(*c).lunite).equipe],-1);
<a name="l01124"></a>01124                                 <a class="code" href="_cases_8c.html#a82382858b44a9b5dea9136eadac8cee1">DestructionUniteCases</a> (c);
<a name="l01125"></a>01125                                 
<a name="l01126"></a>01126                         }
<a name="l01127"></a>01127                 }
<a name="l01128"></a>01128                 <span class="keywordflow">else</span>
<a name="l01129"></a>01129                 {
<a name="l01130"></a>01130                         <span class="keywordflow">if</span> ((*c).lunite == NULL)
<a name="l01131"></a>01131                         {
<a name="l01132"></a>01132                                 (*c).lunite = (<a class="code" href="structs_unite.html">Unite</a>*) malloc (<span class="keyword">sizeof</span> (<a class="code" href="structs_unite.html">Unite</a>));
<a name="l01133"></a>01133                                 <span class="keywordflow">if</span> (selection &lt;= 5)
<a name="l01134"></a>01134                                 {
<a name="l01135"></a>01135                                          <a class="code" href="_unite_8c.html#a513f9afaf118a3c62f342145d7d4b876">InitialisationUnite</a> ((*c).lunite,selection ,1);
<a name="l01136"></a>01136                                 }
<a name="l01137"></a>01137                                 <span class="keywordflow">else</span>
<a name="l01138"></a>01138                                 {
<a name="l01139"></a>01139                                          <a class="code" href="_unite_8c.html#a513f9afaf118a3c62f342145d7d4b876">InitialisationUnite</a> ((*c).lunite,selection-5 ,0);
<a name="l01140"></a>01140                                 }
<a name="l01141"></a>01141                                 (*(*c).lunite).utilise = 0;
<a name="l01142"></a>01142                                 <a class="code" href="_joueur_8c.html#a66002dd8effd92da1c264d87ea81f84b">ModificationNombreUnites</a> (&amp;(*j).tableau_de_joueurs[(*(*c).lunite).equipe],1);
<a name="l01143"></a>01143                         }
<a name="l01144"></a>01144                         <span class="keywordflow">else</span>
<a name="l01145"></a>01145                         {
<a name="l01146"></a>01146                                 <span class="keywordflow">if</span> (selection &lt;= 5)
<a name="l01147"></a>01147                                 {
<a name="l01148"></a>01148                                         <span class="keywordflow">if</span> ((*(*c).lunite).equipe != 1)
<a name="l01149"></a>01149                                         {
<a name="l01150"></a>01150                                                 <a class="code" href="_joueur_8c.html#a66002dd8effd92da1c264d87ea81f84b">ModificationNombreUnites</a> (&amp;(*j).tableau_de_joueurs[0],-1);
<a name="l01151"></a>01151                                                 <a class="code" href="_joueur_8c.html#a66002dd8effd92da1c264d87ea81f84b">ModificationNombreUnites</a> (&amp;(*j).tableau_de_joueurs[1],1);
<a name="l01152"></a>01152                                         }
<a name="l01153"></a>01153                                         <a class="code" href="_unite_8c.html#a513f9afaf118a3c62f342145d7d4b876">InitialisationUnite</a> ((*c).lunite,selection ,1);
<a name="l01154"></a>01154                                         (*(*c).lunite).utilise = 0;
<a name="l01155"></a>01155                                 }
<a name="l01156"></a>01156                                 <span class="keywordflow">else</span>
<a name="l01157"></a>01157                                 {
<a name="l01158"></a>01158                                         <span class="keywordflow">if</span> ((*(*c).lunite).equipe != 0)
<a name="l01159"></a>01159                                         {
<a name="l01160"></a>01160                                                 <a class="code" href="_joueur_8c.html#a66002dd8effd92da1c264d87ea81f84b">ModificationNombreUnites</a> (&amp;(*j).tableau_de_joueurs[1],-1);
<a name="l01161"></a>01161                                                 <a class="code" href="_joueur_8c.html#a66002dd8effd92da1c264d87ea81f84b">ModificationNombreUnites</a> (&amp;(*j).tableau_de_joueurs[0],1);
<a name="l01162"></a>01162                                         }
<a name="l01163"></a>01163                                          <a class="code" href="_unite_8c.html#a513f9afaf118a3c62f342145d7d4b876">InitialisationUnite</a> ((*c).lunite,selection-5 ,0);
<a name="l01164"></a>01164                                          (*(*c).lunite).utilise = 0;
<a name="l01165"></a>01165                                 }
<a name="l01166"></a>01166                         }
<a name="l01167"></a>01167                 }
<a name="l01168"></a>01168         }
<a name="l01169"></a>01169 }
</pre></div></div><!-- contents -->
</div>
  <div id="nav-path" class="navpath">
    <ul>
      <li class="navelem"><a class="el" href="_jeu_8c.html">Jeu.c</a>      </li>

    <li class="footer">Généré le Jeudi Juin 7 2012 11:43:12 pour STRATEGIC CONSTRUCTION par
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.0 </li>
   </ul>
 </div>


</body>
</html>
